Base | Representation |
---|---|
bin | 1010111011001101000000… |
… | …1110011111111000000010 |
3 | 1120112100122101222002212102 |
4 | 2232303100032133320002 |
5 | 3033302012314133442 |
6 | 41314201050230402 |
7 | 2346566026331111 |
oct | 256632016377002 |
9 | 46470571862772 |
10 | 12012222021122 |
11 | 391139a19a204 |
12 | 1420070a25402 |
13 | 69199484ba4b |
14 | 2d7574cb1c78 |
15 | 15c6eadea232 |
hex | aecd039fe02 |
12012222021122 has 16 divisors (see below), whose sum is σ = 18968737269600. Its totient is φ = 5689378628640.
The previous prime is 12012222021091. The next prime is 12012222021127. The reversal of 12012222021122 is 22112022221021.
12012222021122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×120122220211222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12012222021094 and 12012222021103.
It is not an unprimeable number, because it can be changed into a prime (12012222021127) 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, 16904972 + ... + 17601207.
It is an arithmetic number, because the mean of its divisors is an integer number (1185546079350).
Almost surely, 212012222021122 is an apocalyptic number.
12012222021122 is a deficient number, since it is larger than the sum of its proper divisors (6956515248478).
12012222021122 is a wasteful number, since it uses less digits than its factorization.
12012222021122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34515361.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 12012222021122 its reverse (22112022221021), we get a palindrome (34124244242143).
The spelling of 12012222021122 in words is "twelve trillion, twelve billion, two hundred twenty-two million, twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •