Base | Representation |
---|---|
bin | 1011000000111001101011… |
… | …1000000111101010001001 |
3 | 1120212201022110202010202220 |
4 | 2300032122320013222021 |
5 | 3041403001432210441 |
6 | 41431150331244253 |
7 | 2356632562604511 |
oct | 260163270075211 |
9 | 46781273663686 |
10 | 12110111210121 |
11 | 3949962082801 |
12 | 143702b8a9689 |
13 | 69ac94c568a2 |
14 | 2dc1bd870841 |
15 | 160029b84466 |
hex | b039ae07a89 |
12110111210121 has 16 divisors (see below), whose sum is σ = 16166794076160. Its totient is φ = 8063418516480.
The previous prime is 12110111210117. The next prime is 12110111210159. The reversal of 12110111210121 is 12101211101121.
It is not a de Polignac number, because 12110111210121 - 22 = 12110111210117 is a prime.
It is a super-2 number, since 2×121101112101212 (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 12110111210121.
It is not an unprimeable number, because it can be changed into a prime (12110111210321) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 115819561 + ... + 115924073.
It is an arithmetic number, because the mean of its divisors is an integer number (1010424629760).
Almost surely, 212110111210121 is an apocalyptic number.
It is an amenable number.
12110111210121 is a deficient number, since it is larger than the sum of its proper divisors (4056682866039).
12110111210121 is a wasteful number, since it uses less digits than its factorization.
12110111210121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 151936.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 12110111210121 its reverse (12101211101121), we get a palindrome (24211322311242).
The spelling of 12110111210121 in words is "twelve trillion, one hundred ten billion, one hundred eleven million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •