Base | Representation |
---|---|
bin | 11001000010001010101101… |
… | …011110001000010001000011 |
3 | 112102211110121102011101112012 |
4 | 121002022231132020101003 |
5 | 103412340002104202321 |
6 | 1030055142201323135 |
7 | 32122320110622110 |
oct | 3102125536102103 |
9 | 472743542141465 |
10 | 110100102022211 |
11 | 32099211319074 |
12 | 104221794964ab |
13 | 4958519c81c72 |
14 | 1d28c3275b907 |
15 | cade528a105b |
hex | 6422ad788443 |
110100102022211 has 8 divisors (see below), whose sum is σ = 125924085070080. Its totient is φ = 94299968235528.
The previous prime is 110100102022187. The next prime is 110100102022213. The reversal of 110100102022211 is 112220201001011.
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 110100102022211 - 218 = 110100101760067 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110100102022213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5962305401 + ... + 5962323866.
It is an arithmetic number, because the mean of its divisors is an integer number (15740510633760).
Almost surely, 2110100102022211 is an apocalyptic number.
110100102022211 is a deficient number, since it is larger than the sum of its proper divisors (15823983047869).
110100102022211 is a wasteful number, since it uses less digits than its factorization.
110100102022211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11924630593.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110100102022211 its reverse (112220201001011), we get a palindrome (222320303023222).
The spelling of 110100102022211 in words is "one hundred ten trillion, one hundred billion, one hundred two million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •