Base | Representation |
---|---|
bin | 11001010010010101011011… |
… | …011011011000011100011101 |
3 | 112120202200100022110010001001 |
4 | 121102111123123120130131 |
5 | 104034040334224144442 |
6 | 1032305403441350301 |
7 | 32265511164514243 |
oct | 3122253333303435 |
9 | 476680308403031 |
10 | 111211122099997 |
11 | 32487410180667 |
12 | 10581563938391 |
13 | 4a09218b9450a |
14 | 1d6690b640793 |
15 | cccccaa5a2b7 |
hex | 65255b6d871d |
111211122099997 has 2 divisors, whose sum is σ = 111211122099998. Its totient is φ = 111211122099996.
The previous prime is 111211122099953. The next prime is 111211122100069. The reversal of 111211122099997 is 799990221112111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 90138808269316 + 21072313830681 = 9494146^2 + 4590459^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111211122099997 is a prime.
It is a super-2 number, since 2×1112111220999972 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111211122099097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55605561049998 + 55605561049999.
It is an arithmetic number, because the mean of its divisors is an integer number (55605561049999).
Almost surely, 2111211122099997 is an apocalyptic number.
It is an amenable number.
111211122099997 is a deficient number, since it is larger than the sum of its proper divisors (1).
111211122099997 is an equidigital number, since it uses as much as digits as its factorization.
111211122099997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 367416, while the sum is 55.
The spelling of 111211122099997 in words is "one hundred eleven trillion, two hundred eleven billion, one hundred twenty-two million, ninety-nine thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •