Base | Representation |
---|---|
bin | 10100011111111011… |
… | …011011101010000101 |
3 | 2002210221122202102111 |
4 | 110133323123222011 |
5 | 330034142304312 |
6 | 14040025341021 |
7 | 1406304150652 |
oct | 243773335205 |
9 | 62727582374 |
10 | 22010509957 |
11 | 93753a49a7 |
12 | 4323337771 |
13 | 20ca0919b7 |
14 | 10cb318c29 |
15 | 88c5078a7 |
hex | 51fedba85 |
22010509957 has 2 divisors, whose sum is σ = 22010509958. Its totient is φ = 22010509956.
The previous prime is 22010509951. The next prime is 22010509999. The reversal of 22010509957 is 75990501022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21311912196 + 698597761 = 145986^2 + 26431^2 .
It is a cyclic number.
It is not a de Polignac number, because 22010509957 - 215 = 22010477189 is a prime.
It is a super-2 number, since 2×220105099572 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22010509951) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11005254978 + 11005254979.
It is an arithmetic number, because the mean of its divisors is an integer number (11005254979).
Almost surely, 222010509957 is an apocalyptic number.
It is an amenable number.
22010509957 is a deficient number, since it is larger than the sum of its proper divisors (1).
22010509957 is an equidigital number, since it uses as much as digits as its factorization.
22010509957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56700, while the sum is 40.
The spelling of 22010509957 in words is "twenty-two billion, ten million, five hundred nine thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •