Base | Representation |
---|---|
bin | 10100101011010110… |
… | …00010011100000101 |
3 | 1001122122112100022101 |
4 | 22111223002130011 |
5 | 140213330200312 |
6 | 5033313232101 |
7 | 542044062334 |
oct | 122553023405 |
9 | 31578470271 |
10 | 11101021957 |
11 | 4787268113 |
12 | 2199862631 |
13 | 107bb3835c |
14 | 774489d1b |
15 | 44e896a57 |
hex | 295ac2705 |
11101021957 has 2 divisors, whose sum is σ = 11101021958. Its totient is φ = 11101021956.
The previous prime is 11101021931. The next prime is 11101022011. The reversal of 11101021957 is 75912010111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9579319876 + 1521702081 = 97874^2 + 39009^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11101021957 is a prime.
It is a super-2 number, since 2×111010219572 (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 (11101021907) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550510978 + 5550510979.
It is an arithmetic number, because the mean of its divisors is an integer number (5550510979).
Almost surely, 211101021957 is an apocalyptic number.
It is an amenable number.
11101021957 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101021957 is an equidigital number, since it uses as much as digits as its factorization.
11101021957 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 28.
The spelling of 11101021957 in words is "eleven billion, one hundred one million, twenty-one thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •