Base | Representation |
---|---|
bin | 1011000110110010010000… |
… | …1111010100111010011010 |
3 | 1121020101020112011202112221 |
4 | 2301230210033110322122 |
5 | 3100032014201120442 |
6 | 41545425311254254 |
7 | 2400141630402265 |
oct | 261544417247232 |
9 | 47211215152487 |
10 | 12211200020122 |
11 | 398881707a984 |
12 | 145274221a38a |
13 | 6a76851c98ac |
14 | 30304d359cdc |
15 | 162994794467 |
hex | b1b243d4e9a |
12211200020122 has 4 divisors (see below), whose sum is σ = 18316800030186. Its totient is φ = 6105600010060.
The previous prime is 12211200020113. The next prime is 12211200020141. The reversal of 12211200020122 is 22102000211221.
It is a happy number.
12211200020122 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 can be written as a sum of positive squares in only one way, i.e., 11322141495921 + 889058524201 = 3364839^2 + 942899^2 .
It is a super-2 number, since 2×122112000201222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12211200020096 and 12211200020105.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3052800005029 + ... + 3052800005032.
Almost surely, 212211200020122 is an apocalyptic number.
12211200020122 is a deficient number, since it is larger than the sum of its proper divisors (6105600010064).
12211200020122 is an equidigital number, since it uses as much as digits as its factorization.
12211200020122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6105600010063.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 12211200020122 its reverse (22102000211221), we get a palindrome (34313200231343).
The spelling of 12211200020122 in words is "twelve trillion, two hundred eleven billion, two hundred million, twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •