Base | Representation |
---|---|
bin | 10111001100010011110110… |
… | …101011110000001101010101 |
3 | 111101011012110121020212200022 |
4 | 113030103312223300031111 |
5 | 101332141043113311242 |
6 | 1000534342252554525 |
7 | 30325221261452012 |
oct | 2714236653601525 |
9 | 441135417225608 |
10 | 102001022010197 |
11 | 2a556432844392 |
12 | b534593a82a45 |
13 | 44bb86935287b |
14 | 1b28c392dc709 |
15 | bbd43237a0d2 |
hex | 5cc4f6af0355 |
102001022010197 has 2 divisors, whose sum is σ = 102001022010198. Its totient is φ = 102001022010196.
The previous prime is 102001022010143. The next prime is 102001022010311. The reversal of 102001022010197 is 791010220100201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 88786408403716 + 13214613606481 = 9422654^2 + 3635191^2 .
It is a cyclic number.
It is not a de Polignac number, because 102001022010197 - 236 = 101932302533461 is a prime.
It is a super-2 number, since 2×1020010220101972 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102001022010397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51000511005098 + 51000511005099.
It is an arithmetic number, because the mean of its divisors is an integer number (51000511005099).
Almost surely, 2102001022010197 is an apocalyptic number.
It is an amenable number.
102001022010197 is a deficient number, since it is larger than the sum of its proper divisors (1).
102001022010197 is an equidigital number, since it uses as much as digits as its factorization.
102001022010197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 26.
Adding to 102001022010197 its reverse (791010220100201), we get a palindrome (893011242110398).
The spelling of 102001022010197 in words is "one hundred two trillion, one billion, twenty-two million, ten thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •