Base | Representation |
---|---|
bin | 100100100111001111001… |
… | …1010110100101111011000 |
3 | 122211001122020012022002112 |
4 | 1021032132122310233120 |
5 | 1124421132010114022 |
6 | 14411410514451452 |
7 | 1026361151550020 |
oct | 111163632645730 |
9 | 18731566168075 |
10 | 5032064535512 |
11 | 16700a5276693 |
12 | 6932b8293b88 |
13 | 2a66a20aabc1 |
14 | 1357a6088a80 |
15 | 8ad677098e2 |
hex | 4939e6b4bd8 |
5032064535512 has 64 divisors (see below), whose sum is σ = 10830414450240. Its totient is φ = 2147119718400.
The previous prime is 5032064535503. The next prime is 5032064535521. The reversal of 5032064535512 is 2155354602305.
It is an interprime number because it is at equal distance from previous prime (5032064535503) and next prime (5032064535521).
It is a self number, because there is not a number n which added to its sum of digits gives 5032064535512.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 57192578 + ... + 57280494.
It is an arithmetic number, because the mean of its divisors is an integer number (169225225785).
Almost surely, 25032064535512 is an apocalyptic number.
It is an amenable number.
5032064535512 is an abundant number, since it is smaller than the sum of its proper divisors (5798349914728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5032064535512 is a wasteful number, since it uses less digits than its factorization.
5032064535512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92412 (or 92408 counting only the distinct ones).
The product of its (nonzero) digits is 540000, while the sum is 41.
The spelling of 5032064535512 in words is "five trillion, thirty-two billion, sixty-four million, five hundred thirty-five thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •