Base | Representation |
---|---|
bin | 1001000110101010001100… |
… | …0110100111111001110101 |
3 | 1022102221120211020020011122 |
4 | 2101222203012213321311 |
5 | 2303001000104102242 |
6 | 33142311334513325 |
7 | 2052125246002466 |
oct | 221524306477165 |
9 | 38387524206148 |
10 | 10010010222197 |
11 | 320a2488a0127 |
12 | 1158010205845 |
13 | 577c2acb471b |
14 | 2686b6792d6d |
15 | 1255b3b6ead2 |
hex | 91aa31a7e75 |
10010010222197 has 2 divisors, whose sum is σ = 10010010222198. Its totient is φ = 10010010222196.
The previous prime is 10010010222169. The next prime is 10010010222209. The reversal of 10010010222197 is 79122201001001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9427300892881 + 582709329316 = 3070391^2 + 763354^2 .
It is a cyclic number.
It is not a de Polignac number, because 10010010222197 - 28 = 10010010221941 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10010010222127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005005111098 + 5005005111099.
It is an arithmetic number, because the mean of its divisors is an integer number (5005005111099).
Almost surely, 210010010222197 is an apocalyptic number.
It is an amenable number.
10010010222197 is a deficient number, since it is larger than the sum of its proper divisors (1).
10010010222197 is an equidigital number, since it uses as much as digits as its factorization.
10010010222197 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 10010010222197 its reverse (79122201001001), we get a palindrome (89132211223198).
The spelling of 10010010222197 in words is "ten trillion, ten billion, ten million, two hundred twenty-two thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •