Base | Representation |
---|---|
bin | 101111110001010111111001… |
… | …011111111111101010101001 |
3 | 1000112220110122222110222102002 |
4 | 233301113321133333222221 |
5 | 210014244023342214312 |
6 | 2022503040254420345 |
7 | 62153206101301253 |
oct | 5761277137775251 |
9 | 1015813588428362 |
10 | 210101101132457 |
11 | 60a434162a0597 |
12 | 1b6930018016b5 |
13 | 90305ab0b30b2 |
14 | 39c4d3a128cd3 |
15 | 1945329c284c2 |
hex | bf15f97ffaa9 |
210101101132457 has 2 divisors, whose sum is σ = 210101101132458. Its totient is φ = 210101101132456.
The previous prime is 210101101132397. The next prime is 210101101132459. The reversal of 210101101132457 is 754231101101012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 210097371709696 + 3729422761 = 14494736^2 + 61069^2 .
It is a cyclic number.
It is not a de Polignac number, because 210101101132457 - 26 = 210101101132393 is a prime.
Together with 210101101132459, 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 (210101101132459) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105050550566228 + 105050550566229.
It is an arithmetic number, because the mean of its divisors is an integer number (105050550566229).
Almost surely, 2210101101132457 is an apocalyptic number.
It is an amenable number.
210101101132457 is a deficient number, since it is larger than the sum of its proper divisors (1).
210101101132457 is an equidigital number, since it uses as much as digits as its factorization.
210101101132457 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 29.
Adding to 210101101132457 its reverse (754231101101012), we get a palindrome (964332202233469).
The spelling of 210101101132457 in words is "two hundred ten trillion, one hundred one billion, one hundred one million, one hundred thirty-two thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •