Base | Representation |
---|---|
bin | 101111001000110011… |
… | …1000111111011000101 |
3 | 100200021200211120102212 |
4 | 1132101213013323011 |
5 | 3124303130401242 |
6 | 114300402113205 |
7 | 10212335001434 |
oct | 1362147077305 |
9 | 320250746385 |
10 | 101227200197 |
11 | 39a2612a842 |
12 | 1775094b805 |
13 | 9712b386c6 |
14 | 4c8403111b |
15 | 2976d49782 |
hex | 17919c7ec5 |
101227200197 has 2 divisors, whose sum is σ = 101227200198. Its totient is φ = 101227200196.
The previous prime is 101227200181. The next prime is 101227200211. The reversal of 101227200197 is 791002722101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 52685857156 + 48541343041 = 229534^2 + 220321^2 .
It is a cyclic number.
It is not a de Polignac number, because 101227200197 - 24 = 101227200181 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101227200157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50613600098 + 50613600099.
It is an arithmetic number, because the mean of its divisors is an integer number (50613600099).
Almost surely, 2101227200197 is an apocalyptic number.
It is an amenable number.
101227200197 is a deficient number, since it is larger than the sum of its proper divisors (1).
101227200197 is an equidigital number, since it uses as much as digits as its factorization.
101227200197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3528, while the sum is 32.
Adding to 101227200197 its reverse (791002722101), we get a palindrome (892229922298).
The spelling of 101227200197 in words is "one hundred one billion, two hundred twenty-seven million, two hundred thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •