Base | Representation |
---|---|
bin | 10100110111001001… |
… | …00111011110100101 |
3 | 1001220112210001100022 |
4 | 22123210213132211 |
5 | 140414200030312 |
6 | 5051210524525 |
7 | 544355305634 |
oct | 123344473645 |
9 | 31815701308 |
10 | 11200001957 |
11 | 4828122271 |
12 | 2206a36745 |
13 | 10964b27c1 |
14 | 78369351b |
15 | 4583e9172 |
hex | 29b9277a5 |
11200001957 has 2 divisors, whose sum is σ = 11200001958. Its totient is φ = 11200001956.
The previous prime is 11200001933. The next prime is 11200001959. The reversal of 11200001957 is 75910000211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10177984996 + 1022016961 = 100886^2 + 31969^2 .
It is a cyclic number.
It is not a de Polignac number, because 11200001957 - 222 = 11195807653 is a prime.
Together with 11200001959, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11200001959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5600000978 + 5600000979.
It is an arithmetic number, because the mean of its divisors is an integer number (5600000979).
Almost surely, 211200001957 is an apocalyptic number.
It is an amenable number.
11200001957 is a deficient number, since it is larger than the sum of its proper divisors (1).
11200001957 is an equidigital number, since it uses as much as digits as its factorization.
11200001957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 630, while the sum is 26.
The spelling of 11200001957 in words is "eleven billion, two hundred million, one thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •