Base | Representation |
---|---|
bin | 11011100010011010010110… |
… | …011001001110111111100001 |
3 | 120212211012021021200022221001 |
4 | 123202122112121032333201 |
5 | 111333244344304310032 |
6 | 1105330031220032001 |
7 | 34340024351622466 |
oct | 3342322631167741 |
9 | 525735237608831 |
10 | 121112011010017 |
11 | 35654351916865 |
12 | 1170039b532601 |
13 | 5276a76722c61 |
14 | 21c9bd17bd66d |
15 | e006047ee3e7 |
hex | 6e269664efe1 |
121112011010017 has 2 divisors, whose sum is σ = 121112011010018. Its totient is φ = 121112011010016.
The previous prime is 121112011009987. The next prime is 121112011010033. The reversal of 121112011010017 is 710010110211121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108574399369216 + 12537611640801 = 10419904^2 + 3540849^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121112011010017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121112011009976 and 121112011010003.
It is not a weakly prime, because it can be changed into another prime (121112011010047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60556005505008 + 60556005505009.
It is an arithmetic number, because the mean of its divisors is an integer number (60556005505009).
Almost surely, 2121112011010017 is an apocalyptic number.
It is an amenable number.
121112011010017 is a deficient number, since it is larger than the sum of its proper divisors (1).
121112011010017 is an equidigital number, since it uses as much as digits as its factorization.
121112011010017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28, while the sum is 19.
Adding to 121112011010017 its reverse (710010110211121), we get a palindrome (831122121221138).
The spelling of 121112011010017 in words is "one hundred twenty-one trillion, one hundred twelve billion, eleven million, ten thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •