Base | Representation |
---|---|
bin | 101001111101100011… |
… | …000101000000010100 |
3 | 11022022000211222202000 |
4 | 221331203011000110 |
5 | 1214233320124000 |
6 | 32410510515300 |
7 | 3153346566231 |
oct | 517543050024 |
9 | 138260758660 |
10 | 45056020500 |
11 | 18120a49087 |
12 | 8895205b30 |
13 | 43306c697a |
14 | 2275c92788 |
15 | 128a807000 |
hex | a7d8c5014 |
45056020500 has 384 divisors, whose sum is σ = 154260288000. Its totient is φ = 11322892800.
The previous prime is 45056020463. The next prime is 45056020511. The reversal of 45056020500 is 502065054.
45056020500 is a `hidden beast` number, since 4 + 5 + 0 + 5 + 602 + 0 + 50 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 68998174 + ... + 68998826.
It is an arithmetic number, because the mean of its divisors is an integer number (401719500).
Almost surely, 245056020500 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 45056020500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77130144000).
45056020500 is an abundant number, since it is smaller than the sum of its proper divisors (109204267500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45056020500 is a wasteful number, since it uses less digits than its factorization.
45056020500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 969 (or 951 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 27.
Adding to 45056020500 its reverse (502065054), we get a palindrome (45558085554).
The spelling of 45056020500 in words is "forty-five billion, fifty-six million, twenty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •