Base | Representation |
---|---|
bin | 11001000000111000110111… |
… | …010110101000110100110011 |
3 | 112102112001202211111221212011 |
4 | 121000320313112220310303 |
5 | 103404420012034013021 |
6 | 1025550525554143351 |
7 | 32113056251356240 |
oct | 3100706726506463 |
9 | 472461684457764 |
10 | 110012221001011 |
11 | 32064a1481912a |
12 | 10409132281b57 |
13 | 49501531641c4 |
14 | 1d2489704a5c7 |
15 | caba0c589de1 |
hex | 640e375a8d33 |
110012221001011 has 16 divisors (see below), whose sum is σ = 128416208449536. Its totient is φ = 92280625230816.
The previous prime is 110012221000963. The next prime is 110012221001017. The reversal of 110012221001011 is 110100122210011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 110012221001011 - 211 = 110012220998963 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110012221000982 and 110012221001000.
It is not an unprimeable number, because it can be changed into a prime (110012221001017) 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 15 ways as a sum of consecutive naturals, for example, 13495396 + ... + 20053681.
It is an arithmetic number, because the mean of its divisors is an integer number (8026013028096).
Almost surely, 2110012221001011 is an apocalyptic number.
110012221001011 is a deficient number, since it is larger than the sum of its proper divisors (18403987448525).
110012221001011 is an equidigital number, since it uses as much as digits as its factorization.
110012221001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33559098.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110012221001011 its reverse (110100122210011), we get a palindrome (220112343211022).
The spelling of 110012221001011 in words is "one hundred ten trillion, twelve billion, two hundred twenty-one million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •