Base | Representation |
---|---|
bin | 11001011101111101101000… |
… | …111001011111000010111110 |
3 | 112200121001221021002121022001 |
4 | 121131331220321133002332 |
5 | 104140133403233342342 |
6 | 1034120440411412514 |
7 | 32410320320634166 |
oct | 3135755071370276 |
9 | 480531837077261 |
10 | 112010212012222 |
11 | 3276529a6429a7 |
12 | 106903b545413a |
13 | 4a666964249c4 |
14 | 1d93474b815a6 |
15 | ce3998ecb8b7 |
hex | 65df68e5f0be |
112010212012222 has 16 divisors (see below), whose sum is σ = 172113664135392. Its totient is φ = 54638997166080.
The previous prime is 112010212012213. The next prime is 112010212012253. The reversal of 112010212012222 is 222210212010211.
112010212012222 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 112010212012222.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38997118 + ... + 41770750.
It is an arithmetic number, because the mean of its divisors is an integer number (10757104008462).
Almost surely, 2112010212012222 is an apocalyptic number.
112010212012222 is a deficient number, since it is larger than the sum of its proper divisors (60103452123170).
112010212012222 is a wasteful number, since it uses less digits than its factorization.
112010212012222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3266163.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 112010212012222 its reverse (222210212010211), we get a palindrome (334220424022433).
The spelling of 112010212012222 in words is "one hundred twelve trillion, ten billion, two hundred twelve million, twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •