Base | Representation |
---|---|
bin | 1001000111010011001010… |
… | …1111110101001110000000 |
3 | 1022110222222102102222022201 |
4 | 2101310302233311032000 |
5 | 2303141012041213440 |
6 | 33151331040242544 |
7 | 2052664654302364 |
oct | 221646257651600 |
9 | 38428872388281 |
10 | 10021010101120 |
11 | 3213982a55a57 |
12 | 115a180010454 |
13 | 578c91b98c15 |
14 | 26903b6312a4 |
15 | 125a096d819a |
hex | 91d32bf5380 |
10021010101120 has 64 divisors (see below), whose sum is σ = 23957443677600. Its totient is φ = 4008242341888.
The previous prime is 10021010101099. The next prime is 10021010101139. The reversal of 10021010101120 is 2110101012001.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 10021010101097 and 10021010101106.
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, 16239186 + ... + 16844974.
Almost surely, 210021010101120 is an apocalyptic number.
10021010101120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10021010101120 is an abundant number, since it is smaller than the sum of its proper divisors (13936433576480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10021010101120 is an equidigital number, since it uses as much as digits as its factorization.
10021010101120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 631655 (or 631643 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10021010101120 its reverse (2110101012001), we get a palindrome (12131111113121).
The spelling of 10021010101120 in words is "ten trillion, twenty-one billion, ten million, one hundred one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •