Base | Representation |
---|---|
bin | 11001010010011110101110… |
… | …111000111110100110111011 |
3 | 112120210122010112202221212001 |
4 | 121102132232320332212323 |
5 | 104034221314222131021 |
6 | 1032314135034201431 |
7 | 32266313563030525 |
oct | 3122365670764673 |
9 | 476718115687761 |
10 | 111221112302011 |
11 | 32490677403268 |
12 | 10583491583277 |
13 | 4a0a14b83105a |
14 | 1d671b8372a15 |
15 | ccd1b2b30091 |
hex | 6527aee3e9bb |
111221112302011 has 2 divisors, whose sum is σ = 111221112302012. Its totient is φ = 111221112302010.
The previous prime is 111221112301969. The next prime is 111221112302023. The reversal of 111221112302011 is 110203211122111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111221112302011 - 219 = 111221111777723 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 111221112302011.
It is not a weakly prime, because it can be changed into another prime (111221112308011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55610556151005 + 55610556151006.
It is an arithmetic number, because the mean of its divisors is an integer number (55610556151006).
Almost surely, 2111221112302011 is an apocalyptic number.
111221112302011 is a deficient number, since it is larger than the sum of its proper divisors (1).
111221112302011 is an equidigital number, since it uses as much as digits as its factorization.
111221112302011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 111221112302011 its reverse (110203211122111), we get a palindrome (221424323424122).
The spelling of 111221112302011 in words is "one hundred eleven trillion, two hundred twenty-one billion, one hundred twelve million, three hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •