Base | Representation |
---|---|
bin | 11001000010001100011111… |
… | …010000010011100101111011 |
3 | 112102211122112110020120102010 |
4 | 121002030133100103211323 |
5 | 103412402404304014321 |
6 | 1030100055433341003 |
7 | 32122415320646415 |
oct | 3102143720234573 |
9 | 472748473216363 |
10 | 110102011001211 |
11 | 3209a000947269 |
12 | 10422610867763 |
13 | 495876260a738 |
14 | 1d28d740c19b5 |
15 | cae015284676 |
hex | 64231f41397b |
110102011001211 has 16 divisors (see below), whose sum is σ = 150529784365184. Its totient is φ = 71560377656064.
The previous prime is 110102011001197. The next prime is 110102011001219. The reversal of 110102011001211 is 112100110201011.
It is not a de Polignac number, because 110102011001211 - 27 = 110102011001083 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110102011001219) 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, 2823543385 + ... + 2823582378.
It is an arithmetic number, because the mean of its divisors is an integer number (9408111522824).
Almost surely, 2110102011001211 is an apocalyptic number.
110102011001211 is a deficient number, since it is larger than the sum of its proper divisors (40427773363973).
110102011001211 is an equidigital number, since it uses as much as digits as its factorization.
110102011001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5647125930.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 110102011001211 its reverse (112100110201011), we get a palindrome (222202121202222).
The spelling of 110102011001211 in words is "one hundred ten trillion, one hundred two billion, eleven million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •