Base | Representation |
---|---|
bin | 11011100011110101101000… |
… | …010000000011100111101011 |
3 | 120220011120020202221202211011 |
4 | 123203311220100003213223 |
5 | 111341401110400200021 |
6 | 1105443040500244351 |
7 | 34350064213632214 |
oct | 3343655020034753 |
9 | 526146222852734 |
10 | 121210021100011 |
11 | 35691976a77038 |
12 | 117173929a06b7 |
13 | 5283095babb4c |
14 | 21d084c45040b |
15 | e02e3debade1 |
hex | 6e3d684039eb |
121210021100011 has 2 divisors, whose sum is σ = 121210021100012. Its totient is φ = 121210021100010.
The previous prime is 121210021099967. The next prime is 121210021100033. The reversal of 121210021100011 is 110001120012121.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121210021100011 - 237 = 121072582146539 is a prime.
It is a super-2 number, since 2×1212100211000112 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121210021099964 and 121210021100000.
It is not a weakly prime, because it can be changed into another prime (121210021101011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60605010550005 + 60605010550006.
It is an arithmetic number, because the mean of its divisors is an integer number (60605010550006).
Almost surely, 2121210021100011 is an apocalyptic number.
121210021100011 is a deficient number, since it is larger than the sum of its proper divisors (1).
121210021100011 is an equidigital number, since it uses as much as digits as its factorization.
121210021100011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 121210021100011 its reverse (110001120012121), we get a palindrome (231211141112132).
The spelling of 121210021100011 in words is "one hundred twenty-one trillion, two hundred ten billion, twenty-one million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •