Base | Representation |
---|---|
bin | 101111001000010100… |
… | …1110010100110000101 |
3 | 100200020120120201101001 |
4 | 1132100221302212011 |
5 | 3124240021401203 |
6 | 114255025333301 |
7 | 10212051225406 |
oct | 1362051624605 |
9 | 320216521331 |
10 | 101211122053 |
11 | 39a18049018 |
12 | 17747497231 |
13 | 970c6c9402 |
14 | 4c81c479ad |
15 | 297572091d |
hex | 1790a72985 |
101211122053 has 2 divisors, whose sum is σ = 101211122054. Its totient is φ = 101211122052.
The previous prime is 101211121961. The next prime is 101211122069. The reversal of 101211122053 is 350221112101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 84961756324 + 16249365729 = 291482^2 + 127473^2 .
It is a cyclic number.
It is not a de Polignac number, because 101211122053 - 29 = 101211121541 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101211122053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101211122093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50605561026 + 50605561027.
It is an arithmetic number, because the mean of its divisors is an integer number (50605561027).
Almost surely, 2101211122053 is an apocalyptic number.
It is an amenable number.
101211122053 is a deficient number, since it is larger than the sum of its proper divisors (1).
101211122053 is an equidigital number, since it uses as much as digits as its factorization.
101211122053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 19.
Adding to 101211122053 its reverse (350221112101), we get a palindrome (451432234154).
The spelling of 101211122053 in words is "one hundred one billion, two hundred eleven million, one hundred twenty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •