Base | Representation |
---|---|
bin | 1001101001010010111000… |
… | …11110111001101011111000 |
3 | 2210002122222100022110202212 |
4 | 10310221130132321223320 |
5 | 10240001241112041440 |
6 | 113035441355114252 |
7 | 4316244024166643 |
oct | 464513436715370 |
9 | 83078870273685 |
10 | 21210100112120 |
11 | 6838175626927 |
12 | 24667ab742988 |
13 | bab14723b73a |
14 | 534807d28a5a |
15 | 26bacb607465 |
hex | 134a5c7b9af8 |
21210100112120 has 16 divisors (see below), whose sum is σ = 47722725252360. Its totient is φ = 8484040044832.
The previous prime is 21210100112119. The next prime is 21210100112129. The reversal of 21210100112120 is 2121100101212.
It is a junction number, because it is equal to n+sod(n) for n = 21210100112095 and 21210100112104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21210100112129) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 265126251362 + ... + 265126251441.
Almost surely, 221210100112120 is an apocalyptic number.
21210100112120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21210100112120 is an abundant number, since it is smaller than the sum of its proper divisors (26512625140240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21210100112120 is a wasteful number, since it uses less digits than its factorization.
21210100112120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 530252502814 (or 530252502810 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 21210100112120 its reverse (2121100101212), we get a palindrome (23331200213332).
The spelling of 21210100112120 in words is "twenty-one trillion, two hundred ten billion, one hundred million, one hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •