Base | Representation |
---|---|
bin | 11001001111011010000011… |
… | …101011101001110011101011 |
3 | 112120001110001011112020121011 |
4 | 121033122003223221303223 |
5 | 104022241321100204042 |
6 | 1032033132030124351 |
7 | 32245126436016112 |
oct | 3117320353516353 |
9 | 476043034466534 |
10 | 111009933991147 |
11 | 3240a059795724 |
12 | 1054a5763506b7 |
13 | 49c3265685469 |
14 | 1d5aca3846c79 |
15 | cc7953148a17 |
hex | 64f683ae9ceb |
111009933991147 has 2 divisors, whose sum is σ = 111009933991148. Its totient is φ = 111009933991146.
The previous prime is 111009933991087. The next prime is 111009933991157. The reversal of 111009933991147 is 741199339900111.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111009933991147 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111009933991091 and 111009933991100.
It is not a weakly prime, because it can be changed into another prime (111009933991157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55504966995573 + 55504966995574.
It is an arithmetic number, because the mean of its divisors is an integer number (55504966995574).
Almost surely, 2111009933991147 is an apocalyptic number.
111009933991147 is a deficient number, since it is larger than the sum of its proper divisors (1).
111009933991147 is an equidigital number, since it uses as much as digits as its factorization.
111009933991147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1653372, while the sum is 58.
The spelling of 111009933991147 in words is "one hundred eleven trillion, nine billion, nine hundred thirty-three million, nine hundred ninety-one thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •