Base | Representation |
---|---|
bin | 101110100100111000… |
… | …1101100000001100101 |
3 | 100120011201001120020022 |
4 | 1131021301230001211 |
5 | 3114321113304312 |
6 | 113541030444525 |
7 | 10140432025322 |
oct | 1351161540145 |
9 | 316151046208 |
10 | 100022009957 |
11 | 394678a9551 |
12 | 17475203745 |
13 | 958024799c |
14 | 4babd4db49 |
15 | 2906136172 |
hex | 1749c6c065 |
100022009957 has 2 divisors, whose sum is σ = 100022009958. Its totient is φ = 100022009956.
The previous prime is 100022009929. The next prime is 100022009987. The reversal of 100022009957 is 759900220001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 85786895236 + 14235114721 = 292894^2 + 119311^2 .
It is a cyclic number.
It is not a de Polignac number, because 100022009957 - 28 = 100022009701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100022009987) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50011004978 + 50011004979.
It is an arithmetic number, because the mean of its divisors is an integer number (50011004979).
Almost surely, 2100022009957 is an apocalyptic number.
It is an amenable number.
100022009957 is a deficient number, since it is larger than the sum of its proper divisors (1).
100022009957 is an equidigital number, since it uses as much as digits as its factorization.
100022009957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11340, while the sum is 35.
Adding to 100022009957 its reverse (759900220001), we get a palindrome (859922229958).
The spelling of 100022009957 in words is "one hundred billion, twenty-two million, nine thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •