Base | Representation |
---|---|
bin | 1011000000011000100001… |
… | …1000111001011111000001 |
3 | 1120211212100012121202110020 |
4 | 2300012020120321133001 |
5 | 3041231240020213441 |
6 | 41423115235124053 |
7 | 2356166202123042 |
oct | 260061030713701 |
9 | 46755305552406 |
10 | 12101211101121 |
11 | 394610520911a |
12 | 1435367143629 |
13 | 69a1a70ac5bc |
14 | 2db9b781c8c9 |
15 | 15eba8639e66 |
hex | b01886397c1 |
12101211101121 has 16 divisors (see below), whose sum is σ = 16445536462080. Its totient is φ = 7912293891840.
The previous prime is 12101211101039. The next prime is 12101211101131. The reversal of 12101211101121 is 12110111210121.
It is not a de Polignac number, because 12101211101121 - 29 = 12101211100609 is a prime.
It is a super-2 number, since 2×121012111011212 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 12101211101121.
It is not an unprimeable number, because it can be changed into a prime (12101211101131) 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, 13822456 + ... + 14671833.
It is an arithmetic number, because the mean of its divisors is an integer number (1027846028880).
Almost surely, 212101211101121 is an apocalyptic number.
It is an amenable number.
12101211101121 is a deficient number, since it is larger than the sum of its proper divisors (4344325360959).
12101211101121 is a wasteful number, since it uses less digits than its factorization.
12101211101121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28497016.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 12101211101121 its reverse (12110111210121), we get a palindrome (24211322311242).
The spelling of 12101211101121 in words is "twelve trillion, one hundred one billion, two hundred eleven million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •