Base | Representation |
---|---|
bin | 1001100011011110010111… |
… | …01011000111001010011000 |
3 | 2202101112202010210212002120 |
4 | 10301233023223013022120 |
5 | 10223212142120333422 |
6 | 112403524020101240 |
7 | 4265633626261026 |
oct | 461571353071230 |
9 | 82345663725076 |
10 | 21010102121112 |
11 | 6770374a08055 |
12 | 2433a94834820 |
13 | b95323473b20 |
14 | 528c7420b716 |
15 | 2667c342d45c |
hex | 131bcbac7298 |
21010102121112 has 32 divisors (see below), whose sum is σ = 56565659557680. Its totient is φ = 6464646806400.
The previous prime is 21010102121059. The next prime is 21010102121123. The reversal of 21010102121112 is 21112120101012.
It is a happy number.
It is a super-2 number, since 2×210101021211122 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21010102121091 and 21010102121100.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 33670035139 + ... + 33670035762.
Almost surely, 221010102121112 is an apocalyptic number.
It is an amenable number.
21010102121112 is an abundant number, since it is smaller than the sum of its proper divisors (35555557436568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21010102121112 is a wasteful number, since it uses less digits than its factorization.
21010102121112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67340070923 (or 67340070919 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 21010102121112 its reverse (21112120101012), we get a palindrome (42122222222124).
The spelling of 21010102121112 in words is "twenty-one trillion, ten billion, one hundred two million, one hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •