Base | Representation |
---|---|
bin | 1001000110000101101001… |
… | …1000011110100011010000 |
3 | 1022102000021011000001021210 |
4 | 2101201122120132203100 |
5 | 2302320402224343440 |
6 | 33134010100420120 |
7 | 2051330166313431 |
oct | 221413230364320 |
9 | 38360234001253 |
10 | 10000200231120 |
11 | 3206074364690 |
12 | 11561329a7640 |
13 | 577026793a88 |
14 | 268025971488 |
15 | 1251dc7e5a80 |
hex | 9185a61e8d0 |
10000200231120 has 80 divisors (see below), whose sum is σ = 33818858972352. Its totient is φ = 2424290964480.
The previous prime is 10000200231023. The next prime is 10000200231193. The reversal of 10000200231120 is 2113200200001.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 10000200231096 and 10000200231105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1893974677 + ... + 1893979956.
Almost surely, 210000200231120 is an apocalyptic number.
10000200231120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10000200231120 is an abundant number, since it is smaller than the sum of its proper divisors (23818658741232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10000200231120 is a wasteful number, since it uses less digits than its factorization.
10000200231120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3787954660 (or 3787954654 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 10000200231120 its reverse (2113200200001), we get a palindrome (12113400431121).
The spelling of 10000200231120 in words is "ten trillion, two hundred million, two hundred thirty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •