Base | Representation |
---|---|
bin | 11001001111010000110100… |
… | …001010101001111001001011 |
3 | 112120000111102112210120101002 |
4 | 121033100310022221321023 |
5 | 104022111010030143331 |
6 | 1032024411200445215 |
7 | 32244325503362063 |
oct | 3117206412517113 |
9 | 476014375716332 |
10 | 111000010006091 |
11 | 3240592697a888 |
12 | 1054866691980b |
13 | 49c234366155b |
14 | 1d5a6018303a3 |
15 | cc7571ca39cb |
hex | 64f4342a9e4b |
111000010006091 has 8 divisors (see below), whose sum is σ = 115181143697664. Its totient is φ = 106891591683240.
The previous prime is 111000010006079. The next prime is 111000010006103. The reversal of 111000010006091 is 190600010000111.
It is an interprime number because it is at equal distance from previous prime (111000010006079) and next prime (111000010006103).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111000010006091 - 210 = 111000010005067 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111000010066091) 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 in 7 ways as a sum of consecutive naturals, for example, 18178839071 + ... + 18178845176.
It is an arithmetic number, because the mean of its divisors is an integer number (14397642962208).
Almost surely, 2111000010006091 is an apocalyptic number.
111000010006091 is a deficient number, since it is larger than the sum of its proper divisors (4181133691573).
111000010006091 is an equidigital number, since it uses as much as digits as its factorization.
111000010006091 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36357684361.
The product of its (nonzero) digits is 54, while the sum is 20.
The spelling of 111000010006091 in words is "one hundred eleven trillion, ten million, six thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •