Base | Representation |
---|---|
bin | 11011100011110111100100… |
… | …111000101000010110011001 |
3 | 120220011202122111120010122122 |
4 | 123203313210320220112121 |
5 | 111341414401200023001 |
6 | 1105444024154031025 |
7 | 34350200064140162 |
oct | 3343674470502631 |
9 | 526152574503578 |
10 | 121212112111001 |
11 | 3569284a32559a |
12 | 11717877118475 |
13 | 528333a170362 |
14 | 21d09aa03a769 |
15 | e03012859b1b |
hex | 6e3de4e28599 |
121212112111001 has 16 divisors (see below), whose sum is σ = 123119533785600. Its totient is φ = 119321361197568.
The previous prime is 121212112110989. The next prime is 121212112111007. The reversal of 121212112111001 is 100111211212121.
It is a cyclic number.
It is not a de Polignac number, because 121212112111001 - 214 = 121212112094617 is a prime.
It is a super-2 number, since 2×1212121121110012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (121212112111007) 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, 6738281 + ... + 16965513.
It is an arithmetic number, because the mean of its divisors is an integer number (7694970861600).
Almost surely, 2121212112111001 is an apocalyptic number.
It is an amenable number.
121212112111001 is a deficient number, since it is larger than the sum of its proper divisors (1907421674599).
121212112111001 is a wasteful number, since it uses less digits than its factorization.
121212112111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10228048.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 121212112111001 its reverse (100111211212121), we get a palindrome (221323323323122).
The spelling of 121212112111001 in words is "one hundred twenty-one trillion, two hundred twelve billion, one hundred twelve million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •