Base | Representation |
---|---|
bin | 1000000110001111000… |
… | …0011010101010000000 |
3 | 111022001222212210000101 |
4 | 2001203300122222000 |
5 | 4234400310334302 |
6 | 143524001332144 |
7 | 13023224335000 |
oct | 2014360325200 |
9 | 438058783011 |
10 | 139112589952 |
11 | 53aa7480906 |
12 | 22b64637054 |
13 | 1016ca85cab |
14 | 6a3982c000 |
15 | 3942d80287 |
hex | 2063c1aa80 |
139112589952 has 64 divisors (see below), whose sum is σ = 323193528000. Its totient is φ = 59619662592.
The previous prime is 139112589929. The next prime is 139112589961. The reversal of 139112589952 is 259985211931.
139112589952 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 139112589893 and 139112589902.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1540378 + ... + 1628185.
It is an arithmetic number, because the mean of its divisors is an integer number (5049898875).
Almost surely, 2139112589952 is an apocalyptic number.
It is an amenable number.
139112589952 is an abundant number, since it is smaller than the sum of its proper divisors (184080938048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139112589952 is an frugal number, since it uses more digits than its factorization.
139112589952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3168598 (or 3168572 counting only the distinct ones).
The product of its digits is 1749600, while the sum is 55.
The spelling of 139112589952 in words is "one hundred thirty-nine billion, one hundred twelve million, five hundred eighty-nine thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •