Base | Representation |
---|---|
bin | 1010110000011… |
… | …0111010010000 |
3 | 10010220011222200 |
4 | 2230012322100 |
5 | 43022221242 |
6 | 4251003200 |
7 | 1055326440 |
oct | 254067220 |
9 | 103804880 |
10 | 45117072 |
11 | 23516140 |
12 | 13139500 |
13 | 94689c0 |
14 | 5dc6120 |
15 | 3e6304c |
hex | 2b06e90 |
45117072 has 240 divisors, whose sum is σ = 170072448. Its totient is φ = 10782720.
The previous prime is 45117071. The next prime is 45117073. The reversal of 45117072 is 27071154.
It is an interprime number because it is at equal distance from previous prime (45117071) and next prime (45117073).
It is not an unprimeable number, because it can be changed into a prime (45117071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 143988 + ... + 144300.
Almost surely, 245117072 is an apocalyptic number.
45117072 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 45117072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85036224).
45117072 is an abundant number, since it is smaller than the sum of its proper divisors (124955376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45117072 is a wasteful number, since it uses less digits than its factorization.
45117072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 358 (or 349 counting only the distinct ones).
The product of its (nonzero) digits is 1960, while the sum is 27.
The square root of 45117072 is about 6716.9242961344. The cubic root of 45117072 is about 355.9975171312.
The spelling of 45117072 in words is "forty-five million, one hundred seventeen thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •