Base | Representation |
---|---|
bin | 1001000110110010101110… |
… | …1001101000001111100000 |
3 | 1022110011111110220212201200 |
4 | 2101230223221220033200 |
5 | 2303020143040200000 |
6 | 33143330532201200 |
7 | 2052236104101513 |
oct | 221545351501740 |
9 | 38404443825650 |
10 | 10012301100000 |
11 | 3210213a50571 |
12 | 115854b469200 |
13 | 5782047b4714 |
14 | 268852b28d7a |
15 | 125699d3d500 |
hex | 91b2ba683e0 |
10012301100000 has 216 divisors, whose sum is σ = 35588326966920. Its totient is φ = 2669946720000.
The previous prime is 10012301099981. The next prime is 10012301100037. The reversal of 10012301100000 is 110321001.
It is a super-2 number, since 2×100123011000002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 4662390 + ... + 6462389.
It is an arithmetic number, because the mean of its divisors is an integer number (164760772995).
Almost surely, 210012301100000 is an apocalyptic number.
10012301100000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10012301100000 is an abundant number, since it is smaller than the sum of its proper divisors (25576025866920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10012301100000 is an equidigital number, since it uses as much as digits as its factorization.
10012301100000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11124820 (or 11124789 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 10012301100000 its reverse (110321001), we get a palindrome (10012411421001).
The spelling of 10012301100000 in words is "ten trillion, twelve billion, three hundred one million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •