Base | Representation |
---|---|
bin | 1001101001010110100111… |
… | …10000100001111101001110 |
3 | 2210002212010210202101202211 |
4 | 10310223103300201331032 |
5 | 10240014340403102342 |
6 | 113040412121541034 |
7 | 4316344433304121 |
oct | 464532360417516 |
9 | 83085123671684 |
10 | 21212101222222 |
11 | 6839002161529 |
12 | 246706994477a |
13 | bab3a59b4161 |
14 | 5349579d23b8 |
15 | 26bb97138c17 |
hex | 134ad3c21f4e |
21212101222222 has 4 divisors (see below), whose sum is σ = 31818151833336. Its totient is φ = 10606050611110.
The previous prime is 21212101222217. The next prime is 21212101222349. The reversal of 21212101222222 is 22222210121212.
It is a semiprime because it is the product of two primes.
It is a super-3 number, since 3×212121012222223 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21212101222193 and 21212101222202.
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 as a sum of consecutive naturals, namely, 5303025305554 + ... + 5303025305557.
It is an arithmetic number, because the mean of its divisors is an integer number (7954537958334).
Almost surely, 221212101222222 is an apocalyptic number.
21212101222222 is a deficient number, since it is larger than the sum of its proper divisors (10606050611114).
21212101222222 is a wasteful number, since it uses less digits than its factorization.
21212101222222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10606050611113.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 21212101222222 its reverse (22222210121212), we get a palindrome (43434311343434).
The spelling of 21212101222222 in words is "twenty-one trillion, two hundred twelve billion, one hundred one million, two hundred twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •