Base | Representation |
---|---|
bin | 1010110000001… |
… | …0110110110110 |
3 | 10010212100012210 |
4 | 2230002312312 |
5 | 43021203340 |
6 | 4250354250 |
7 | 1055230152 |
oct | 254026666 |
9 | 103770183 |
10 | 45100470 |
11 | 23504718 |
12 | 1312b986 |
13 | 946128c |
14 | 5dc0062 |
15 | 3e5d180 |
hex | 2b02db6 |
45100470 has 64 divisors (see below), whose sum is σ = 113923584. Its totient is φ = 11404800.
The previous prime is 45100453. The next prime is 45100477. The reversal of 45100470 is 7400154.
45100470 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45100477) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 112270 + ... + 112670.
It is an arithmetic number, because the mean of its divisors is an integer number (1780056).
Almost surely, 245100470 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 45100470, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56961792).
45100470 is an abundant number, since it is smaller than the sum of its proper divisors (68823114).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45100470 is a wasteful number, since it uses less digits than its factorization.
45100470 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 597.
The product of its (nonzero) digits is 560, while the sum is 21.
The square root of 45100470 is about 6715.6883489334. The cubic root of 45100470 is about 355.9538455924.
The spelling of 45100470 in words is "forty-five million, one hundred thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •