Base | Representation |
---|---|
bin | 10110110000101011010000… |
… | …010010000111010111010001 |
3 | 111010102122202122110200122212 |
4 | 112300223100102013113101 |
5 | 101110032400031212012 |
6 | 552522120332041505 |
7 | 30041062634466365 |
oct | 2660532022072721 |
9 | 433378678420585 |
10 | 100102002210257 |
11 | 299940256594a3 |
12 | b288532003295 |
13 | 43b17696c4a88 |
14 | 1aa0d69b452a5 |
15 | b88d396a6b22 |
hex | 5b0ad04875d1 |
100102002210257 has 2 divisors, whose sum is σ = 100102002210258. Its totient is φ = 100102002210256.
The previous prime is 100102002210193. The next prime is 100102002210263. The reversal of 100102002210257 is 752012200201001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77287852405201 + 22814149805056 = 8791351^2 + 4776416^2 .
It is a cyclic number.
It is not a de Polignac number, because 100102002210257 - 26 = 100102002210193 is a prime.
It is not a weakly prime, because it can be changed into another prime (100102002210277) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50051001105128 + 50051001105129.
It is an arithmetic number, because the mean of its divisors is an integer number (50051001105129).
Almost surely, 2100102002210257 is an apocalyptic number.
It is an amenable number.
100102002210257 is a deficient number, since it is larger than the sum of its proper divisors (1).
100102002210257 is an equidigital number, since it uses as much as digits as its factorization.
100102002210257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 23.
Adding to 100102002210257 its reverse (752012200201001), we get a palindrome (852114202411258).
The spelling of 100102002210257 in words is "one hundred trillion, one hundred two billion, two million, two hundred ten thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.239 sec. • engine limits •