Base | Representation |
---|---|
bin | 11010001001011111111101… |
… | …011010110000111010001001 |
3 | 120002012002021011220100101221 |
4 | 122021133331122300322021 |
5 | 110033143044224031441 |
6 | 1044331105004442041 |
7 | 33136422535516312 |
oct | 3211377532607211 |
9 | 502162234810357 |
10 | 115002001002121 |
11 | 33709090519212 |
12 | 10a941a9549321 |
13 | 4c22846aa0c3c |
14 | 20581ab363609 |
15 | d466ec9438d1 |
hex | 6897fd6b0e89 |
115002001002121 has 2 divisors, whose sum is σ = 115002001002122. Its totient is φ = 115002001002120.
The previous prime is 115002001002101. The next prime is 115002001002157. The reversal of 115002001002121 is 121200100200511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100519873921600 + 14482127080521 = 10025960^2 + 3805539^2 .
It is a cyclic number.
It is not a de Polignac number, because 115002001002121 - 217 = 115002000871049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 115002001002095 and 115002001002104.
It is not a weakly prime, because it can be changed into another prime (115002001002101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57501000501060 + 57501000501061.
It is an arithmetic number, because the mean of its divisors is an integer number (57501000501061).
Almost surely, 2115002001002121 is an apocalyptic number.
It is an amenable number.
115002001002121 is a deficient number, since it is larger than the sum of its proper divisors (1).
115002001002121 is an equidigital number, since it uses as much as digits as its factorization.
115002001002121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 40, while the sum is 16.
Adding to 115002001002121 its reverse (121200100200511), we get a palindrome (236202101202632).
The spelling of 115002001002121 in words is "one hundred fifteen trillion, two billion, one million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •