Base | Representation |
---|---|
bin | 11011100101010011110010… |
… | …001101110000011111101111 |
3 | 120220112020012112101001211202 |
4 | 123211103302031300133233 |
5 | 111400030133210013012 |
6 | 1110001320440440115 |
7 | 34360303433255546 |
oct | 3345236215603757 |
9 | 526466175331752 |
10 | 121311120001007 |
11 | 35720836736782 |
12 | 11732aa877903b |
13 | 528c788275c61 |
14 | 21d56bd40515d |
15 | e058a9920cc2 |
hex | 6e54f23707ef |
121311120001007 has 2 divisors, whose sum is σ = 121311120001008. Its totient is φ = 121311120001006.
The previous prime is 121311120000911. The next prime is 121311120001031. The reversal of 121311120001007 is 700100021113121.
It is a strong prime.
It is an emirp because it is prime and its reverse (700100021113121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121311120001007 - 218 = 121311119738863 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121311120001007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121311120001207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60655560000503 + 60655560000504.
It is an arithmetic number, because the mean of its divisors is an integer number (60655560000504).
Almost surely, 2121311120001007 is an apocalyptic number.
121311120001007 is a deficient number, since it is larger than the sum of its proper divisors (1).
121311120001007 is an equidigital number, since it uses as much as digits as its factorization.
121311120001007 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84, while the sum is 20.
Adding to 121311120001007 its reverse (700100021113121), we get a palindrome (821411141114128).
The spelling of 121311120001007 in words is "one hundred twenty-one trillion, three hundred eleven billion, one hundred twenty million, one thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •