Base | Representation |
---|---|
bin | 1001100011001011100011… |
… | …01011011001101110001100 |
3 | 2202100120200021020110010011 |
4 | 10301211301223121232030 |
5 | 10223031001043004400 |
6 | 112355133510123004 |
7 | 4265125430313436 |
oct | 461456153315614 |
9 | 82316607213104 |
10 | 21000002313100 |
11 | 6767061922888 |
12 | 2431b36350464 |
13 | b943a3bac375 |
14 | 528596b07656 |
15 | 2663d19078ba |
hex | 131971ad9b8c |
21000002313100 has 18 divisors (see below), whose sum is σ = 45570005019644. Its totient is φ = 8400000925200.
The previous prime is 21000002313083. The next prime is 21000002313107. The reversal of 21000002313100 is 131320000012.
It is a super-2 number, since 2×210000023131002 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21000002313107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 105000011466 + ... + 105000011665.
Almost surely, 221000002313100 is an apocalyptic number.
21000002313100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21000002313100 is an abundant number, since it is smaller than the sum of its proper divisors (24570002706544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21000002313100 is a wasteful number, since it uses less digits than its factorization.
21000002313100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210000023145 (or 210000023138 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 21000002313100 its reverse (131320000012), we get a palindrome (21131322313112).
The spelling of 21000002313100 in words is "twenty-one trillion, two million, three hundred thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •