Base | Representation |
---|---|
bin | 1000001000010111001… |
… | …1001101110010111100 |
3 | 111100112210121200000010 |
4 | 2002011303031302330 |
5 | 4242033014432202 |
6 | 144100403303220 |
7 | 13043331163611 |
oct | 2020563156274 |
9 | 440483550003 |
10 | 139683749052 |
11 | 5426a920121 |
12 | 230a397ab10 |
13 | 102311c4363 |
14 | 6a91628508 |
15 | 39780a276c |
hex | 2085ccdcbc |
139683749052 has 24 divisors (see below), whose sum is σ = 325935166032. Its totient is φ = 46560332800.
The previous prime is 139683749047. The next prime is 139683749129. The reversal of 139683749052 is 250947386931.
It is a super-2 number, since 2×1396837490522 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 139683748983 and 139683749001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 834652 + ... + 987932.
It is an arithmetic number, because the mean of its divisors is an integer number (13580631918).
It is a 1-persistent number, because it is pandigital, but 2⋅139683749052 = 279367498104 is not.
Almost surely, 2139683749052 is an apocalyptic number.
139683749052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
139683749052 is an abundant number, since it is smaller than the sum of its proper divisors (186251416980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139683749052 is a wasteful number, since it uses less digits than its factorization.
139683749052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 229229 (or 229227 counting only the distinct ones).
The product of its (nonzero) digits is 9797760, while the sum is 57.
The spelling of 139683749052 in words is "one hundred thirty-nine billion, six hundred eighty-three million, seven hundred forty-nine thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •