Base | Representation |
---|---|
bin | 11011100000111011010110… |
… | …101010101011110010110101 |
3 | 120212110102222122222210110011 |
4 | 123200323112222223302311 |
5 | 111330112000042024112 |
6 | 1105211121534500221 |
7 | 34326453600366556 |
oct | 3340732652536265 |
9 | 525412878883404 |
10 | 121010010111157 |
11 | 35615069a8a842 |
12 | 116a4673664671 |
13 | 526a26c512cbb |
14 | 21c4cb6b0c32d |
15 | decb34ac5aa7 |
hex | 6e0ed6aabcb5 |
121010010111157 has 2 divisors, whose sum is σ = 121010010111158. Its totient is φ = 121010010111156.
The previous prime is 121010010111101. The next prime is 121010010111187. The reversal of 121010010111157 is 751111010010121.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83900360561796 + 37109649549361 = 9159714^2 + 6091769^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121010010111157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121010010111187) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60505005055578 + 60505005055579.
It is an arithmetic number, because the mean of its divisors is an integer number (60505005055579).
Almost surely, 2121010010111157 is an apocalyptic number.
It is an amenable number.
121010010111157 is a deficient number, since it is larger than the sum of its proper divisors (1).
121010010111157 is an equidigital number, since it uses as much as digits as its factorization.
121010010111157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 70, while the sum is 22.
Adding to 121010010111157 its reverse (751111010010121), we get a palindrome (872121020121278).
The spelling of 121010010111157 in words is "one hundred twenty-one trillion, ten billion, ten million, one hundred eleven thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •