Base | Representation |
---|---|
bin | 11101011011010101101… |
… | …10100110010001011101 |
3 | 10120122211222212111210212 |
4 | 32231222312212101131 |
5 | 113031223130340442 |
6 | 2052255244342205 |
7 | 133023151203401 |
oct | 16555266462135 |
9 | 3518758774725 |
10 | 1011110011997 |
11 | 35a89a273398 |
12 | 143b62844965 |
13 | 74468c30b37 |
14 | 36d1bb93101 |
15 | 1b47bcd6a82 |
hex | eb6ada645d |
1011110011997 has 2 divisors, whose sum is σ = 1011110011998. Its totient is φ = 1011110011996.
The previous prime is 1011110011981. The next prime is 1011110012021. The reversal of 1011110011997 is 7991100111101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 839387624761 + 171722387236 = 916181^2 + 414394^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011110011997 - 24 = 1011110011981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011110011097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505555005998 + 505555005999.
It is an arithmetic number, because the mean of its divisors is an integer number (505555005999).
Almost surely, 21011110011997 is an apocalyptic number.
It is an amenable number.
1011110011997 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011110011997 is an equidigital number, since it uses as much as digits as its factorization.
1011110011997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567, while the sum is 32.
The spelling of 1011110011997 in words is "one trillion, eleven billion, one hundred ten million, eleven thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •