Base | Representation |
---|---|
bin | 11001001111101110100111… |
… | …101000100111100111101011 |
3 | 112120010120000211012220120121 |
4 | 121033232213220213213223 |
5 | 104023122030033341021 |
6 | 1032051222510504111 |
7 | 32246540523055636 |
oct | 3117564750474753 |
9 | 476116024186517 |
10 | 111032012012011 |
11 | 32418459200562 |
12 | 105528b8205037 |
13 | 49c5373723a2c |
14 | 1d5bd99ad6c1d |
15 | cc82e6539741 |
hex | 64fba7a279eb |
111032012012011 has 8 divisors (see below), whose sum is σ = 111687219512960. Its totient is φ = 110378209030272.
The previous prime is 111032012011931. The next prime is 111032012012027. The reversal of 111032012012011 is 110210210230111.
It is a happy number.
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 111032012012011 - 217 = 111032011880939 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111032012012041) 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 in 7 ways as a sum of consecutive naturals, for example, 350971230 + ... + 351287443.
It is an arithmetic number, because the mean of its divisors is an integer number (13960902439120).
Almost surely, 2111032012012011 is an apocalyptic number.
111032012012011 is a deficient number, since it is larger than the sum of its proper divisors (655207500949).
111032012012011 is an equidigital number, since it uses as much as digits as its factorization.
111032012012011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 702259605.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 111032012012011 its reverse (110210210230111), we get a palindrome (221242222242122).
The spelling of 111032012012011 in words is "one hundred eleven trillion, thirty-two billion, twelve million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •