Base | Representation |
---|---|
bin | 1001001110001110000011… |
… | …1110110000001100000000 |
3 | 1022220100211212210202011110 |
4 | 2103203200332300030000 |
5 | 2312113002211141443 |
6 | 33322112103043320 |
7 | 2064404052336030 |
oct | 223434076601400 |
9 | 38810755722143 |
10 | 10139897365248 |
11 | 325a340797152 |
12 | 117921b140540 |
13 | 58725a6936a1 |
14 | 270ab8c818c0 |
15 | 128b66b3e233 |
hex | 938e0fb0300 |
10139897365248 has 288 divisors, whose sum is σ = 31351577883136. Its totient is φ = 2849632026624.
The previous prime is 10139897365201. The next prime is 10139897365253. The reversal of 10139897365248 is 84256379893101.
It is a happy number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 84940290 + ... + 85059582.
It is a 1-persistent number, because it is pandigital, but 2⋅10139897365248 = 20279794730496 is not.
Almost surely, 210139897365248 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 10139897365248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15675788941568).
10139897365248 is an abundant number, since it is smaller than the sum of its proper divisors (21211680517888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10139897365248 is a wasteful number, since it uses less digits than its factorization.
10139897365248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119579 (or 119565 counting only the distinct ones).
The product of its (nonzero) digits is 78382080, while the sum is 66.
The spelling of 10139897365248 in words is "ten trillion, one hundred thirty-nine billion, eight hundred ninety-seven million, three hundred sixty-five thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •