Base | Representation |
---|---|
bin | 11001001111101101111111… |
… | …000111000101010010011111 |
3 | 112120010111021102220102112102 |
4 | 121033231333013011102133 |
5 | 104023114132011210444 |
6 | 1032051031222355315 |
7 | 32246514626143316 |
oct | 3117557707052237 |
9 | 476114242812472 |
10 | 111031332131999 |
11 | 3241813a453654 |
12 | 1055274858bb3b |
13 | 49c529590a576 |
14 | 1d5bd336b927d |
15 | cc82a69dd84e |
hex | 64fb7f1c549f |
111031332131999 has 2 divisors, whose sum is σ = 111031332132000. Its totient is φ = 111031332131998.
The previous prime is 111031332131987. The next prime is 111031332132001. The reversal of 111031332131999 is 999131233130111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111031332131999 - 24 = 111031332131983 is a prime.
Together with 111031332132001, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111031332131399) 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, 55515666065999 + 55515666066000.
It is an arithmetic number, because the mean of its divisors is an integer number (55515666066000).
Almost surely, 2111031332131999 is an apocalyptic number.
111031332131999 is a deficient number, since it is larger than the sum of its proper divisors (1).
111031332131999 is an equidigital number, since it uses as much as digits as its factorization.
111031332131999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 118098, while the sum is 47.
The spelling of 111031332131999 in words is "one hundred eleven trillion, thirty-one billion, three hundred thirty-two million, one hundred thirty-one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •