Base | Representation |
---|---|
bin | 1011000001100101111110… |
… | …0100100010001110101110 |
3 | 1120220212000002201020220202 |
4 | 2300121133210202032232 |
5 | 3042101324241402342 |
6 | 41440434225313502 |
7 | 2360533326312335 |
oct | 260313744421656 |
9 | 46825002636822 |
10 | 12122001122222 |
11 | 3953a03682742 |
12 | 14393a9795892 |
13 | 69c13b355034 |
14 | 2dc9ca9d2d1c |
15 | 1604c390b332 |
hex | b065f9223ae |
12122001122222 has 4 divisors (see below), whose sum is σ = 18183001683336. Its totient is φ = 6061000561110.
The previous prime is 12122001122123. The next prime is 12122001122323. The reversal of 12122001122222 is 22222110022121.
12122001122222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×121220011222222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12122001122194 and 12122001122203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3030500280554 + ... + 3030500280557.
It is an arithmetic number, because the mean of its divisors is an integer number (4545750420834).
Almost surely, 212122001122222 is an apocalyptic number.
12122001122222 is a deficient number, since it is larger than the sum of its proper divisors (6061000561114).
12122001122222 is an equidigital number, since it uses as much as digits as its factorization.
12122001122222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6061000561113.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 12122001122222 its reverse (22222110022121), we get a palindrome (34344111144343).
The spelling of 12122001122222 in words is "twelve trillion, one hundred twenty-two billion, one million, one hundred twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •