Base | Representation |
---|---|
bin | 1001101001010110100111… |
… | …01011111100011110011010 |
3 | 2210002212010201111022210121 |
4 | 10310223103223330132122 |
5 | 10240014340101120442 |
6 | 113040412040103454 |
7 | 4316344420136344 |
oct | 464532353743632 |
9 | 83085121438717 |
10 | 21212100020122 |
11 | 6839001510360 |
12 | 2467069464b8a |
13 | bab3a5682c5b |
14 | 53495779c294 |
15 | 26bb96e9c967 |
hex | 134ad3afc79a |
21212100020122 has 16 divisors (see below), whose sum is σ = 34911349067232. Its totient is φ = 9586130327920.
The previous prime is 21212100020117. The next prime is 21212100020129. The reversal of 21212100020122 is 22102000121212.
It is a happy number.
It is a super-3 number, since 3×212121000201223 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21212100020096 and 21212100020105.
It is not an unprimeable number, because it can be changed into a prime (21212100020129) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2786661988 + ... + 2786669599.
It is an arithmetic number, because the mean of its divisors is an integer number (2181959316702).
Almost surely, 221212100020122 is an apocalyptic number.
21212100020122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21212100020122 is a deficient number, since it is larger than the sum of its proper divisors (13699249047110).
21212100020122 is a wasteful number, since it uses less digits than its factorization.
21212100020122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5573331773.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 21212100020122 its reverse (22102000121212), we get a palindrome (43314100141334).
The spelling of 21212100020122 in words is "twenty-one trillion, two hundred twelve billion, one hundred million, twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •