Base | Representation |
---|---|
bin | 1001010010111111111111… |
… | …1111110010111100010101 |
3 | 1100012012211022000002101102 |
4 | 2110233333333302330111 |
5 | 2314434200130022442 |
6 | 33423533201235445 |
7 | 2103342144220454 |
oct | 224577777627425 |
9 | 40165738002342 |
10 | 10222022110997 |
11 | 3291153aa3154 |
12 | 119111a632b85 |
13 | 591c17a6b8b8 |
14 | 274a69ca8b9b |
15 | 12ad71912232 |
hex | 94bffff2f15 |
10222022110997 has 2 divisors, whose sum is σ = 10222022110998. Its totient is φ = 10222022110996.
The previous prime is 10222022110969. The next prime is 10222022111017. The reversal of 10222022110997 is 79901122022201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7846351685956 + 2375670425041 = 2801134^2 + 1541321^2 .
It is an emirp because it is prime and its reverse (79901122022201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10222022110997 - 26 = 10222022110933 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10222022110997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10222022110967) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5111011055498 + 5111011055499.
It is an arithmetic number, because the mean of its divisors is an integer number (5111011055499).
Almost surely, 210222022110997 is an apocalyptic number.
It is an amenable number.
10222022110997 is a deficient number, since it is larger than the sum of its proper divisors (1).
10222022110997 is an equidigital number, since it uses as much as digits as its factorization.
10222022110997 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18144, while the sum is 38.
The spelling of 10222022110997 in words is "ten trillion, two hundred twenty-two billion, twenty-two million, one hundred ten thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •