Base | Representation |
---|---|
bin | 1010111011001101000000… |
… | …0111001011011001001110 |
3 | 1120112100122021100121122001 |
4 | 2232303100013023121032 |
5 | 3033302011321232342 |
6 | 41314200541142514 |
7 | 2346566004116464 |
oct | 256632007133116 |
9 | 46470567317561 |
10 | 12012220102222 |
11 | 39113990a953a |
12 | 142007025aa3a |
13 | 6919943294c2 |
14 | 2d7574932834 |
15 | 15c6eab6b8b7 |
hex | aecd01cb64e |
12012220102222 has 4 divisors (see below), whose sum is σ = 18018330153336. Its totient is φ = 6006110051110.
The previous prime is 12012220102189. The next prime is 12012220102237. The reversal of 12012220102222 is 22220102221021.
12012220102222 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×120122201022222 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12012220102222.
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, 3003055025554 + ... + 3003055025557.
It is an arithmetic number, because the mean of its divisors is an integer number (4504582538334).
Almost surely, 212012220102222 is an apocalyptic number.
12012220102222 is a deficient number, since it is larger than the sum of its proper divisors (6006110051114).
12012220102222 is an equidigital number, since it uses as much as digits as its factorization.
12012220102222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6006110051113.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 12012220102222 its reverse (22220102221021), we get a palindrome (34232322323243).
The spelling of 12012220102222 in words is "twelve trillion, twelve billion, two hundred twenty million, one hundred two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •