Base | Representation |
---|---|
bin | 10100100010000010… |
… | …01110001000101101 |
3 | 1001110012121221000212 |
4 | 22101001032020231 |
5 | 140033333412312 |
6 | 5021444032205 |
7 | 540105352154 |
oct | 122101161055 |
9 | 31405557025 |
10 | 11022950957 |
11 | 4747194227 |
12 | 2177692665 |
13 | 1068901cb5 |
14 | 767d6659b |
15 | 447ac4822 |
hex | 29104e22d |
11022950957 has 2 divisors, whose sum is σ = 11022950958. Its totient is φ = 11022950956.
The previous prime is 11022950927. The next prime is 11022950963. The reversal of 11022950957 is 75905922011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10384832836 + 638118121 = 101906^2 + 25261^2 .
It is an emirp because it is prime and its reverse (75905922011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11022950957 - 216 = 11022885421 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11022950927) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5511475478 + 5511475479.
It is an arithmetic number, because the mean of its divisors is an integer number (5511475479).
Almost surely, 211022950957 is an apocalyptic number.
It is an amenable number.
11022950957 is a deficient number, since it is larger than the sum of its proper divisors (1).
11022950957 is an equidigital number, since it uses as much as digits as its factorization.
11022950957 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 41.
The spelling of 11022950957 in words is "eleven billion, twenty-two million, nine hundred fifty thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •