Base | Representation |
---|---|
bin | 10111000000111101100000… |
… | …011011100011010100101001 |
3 | 111021101122101100011110002212 |
4 | 113000331200123203110221 |
5 | 101231401314144201022 |
6 | 555140200440534505 |
7 | 30214661342552531 |
oct | 2700754033432451 |
9 | 437348340143085 |
10 | 101221112100137 |
11 | 2a2856a5a51607 |
12 | b4293b5781435 |
13 | 44631576349a3 |
14 | 1add1b11d04c1 |
15 | ba7ed7b9c3e2 |
hex | 5c0f606e3529 |
101221112100137 has 2 divisors, whose sum is σ = 101221112100138. Its totient is φ = 101221112100136.
The previous prime is 101221112099981. The next prime is 101221112100139. The reversal of 101221112100137 is 731001211122101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65926296489001 + 35294815611136 = 8119501^2 + 5940944^2 .
It is a cyclic number.
It is not a de Polignac number, because 101221112100137 - 246 = 30852367922473 is a prime.
Together with 101221112100139, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (101221112100139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50610556050068 + 50610556050069.
It is an arithmetic number, because the mean of its divisors is an integer number (50610556050069).
Almost surely, 2101221112100137 is an apocalyptic number.
It is an amenable number.
101221112100137 is a deficient number, since it is larger than the sum of its proper divisors (1).
101221112100137 is an equidigital number, since it uses as much as digits as its factorization.
101221112100137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 168, while the sum is 23.
Adding to 101221112100137 its reverse (731001211122101), we get a palindrome (832222323222238).
The spelling of 101221112100137 in words is "one hundred one trillion, two hundred twenty-one billion, one hundred twelve million, one hundred thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •