Base | Representation |
---|---|
bin | 1011000000111101110100… |
… | …0101110101000011110010 |
3 | 1120212211011220002012111021 |
4 | 2300033131011311003302 |
5 | 3041412240324201320 |
6 | 41431452453410054 |
7 | 2360002242165232 |
oct | 260173505650362 |
9 | 46784156065437 |
10 | 12111222100210 |
11 | 394a382155992 |
12 | 143729b93992a |
13 | 69b11114b2bc |
14 | 2dc287205cc2 |
15 | 16009246bdaa |
hex | b03dd1750f2 |
12111222100210 has 8 divisors (see below), whose sum is σ = 21800199780396. Its totient is φ = 4844488840080.
The previous prime is 12111222100189. The next prime is 12111222100213. The reversal of 12111222100210 is 1200122211121.
12111222100210 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 9971909255889 + 2139312844321 = 3157833^2 + 1462639^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (12111222100213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 605561105001 + ... + 605561105020.
Almost surely, 212111222100210 is an apocalyptic number.
12111222100210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12111222100210 is a deficient number, since it is larger than the sum of its proper divisors (9688977680186).
12111222100210 is a wasteful number, since it uses less digits than its factorization.
12111222100210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1211122210028.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 12111222100210 its reverse (1200122211121), we get a palindrome (13311344311331).
The spelling of 12111222100210 in words is "twelve trillion, one hundred eleven billion, two hundred twenty-two million, one hundred thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •