Base | Representation |
---|---|
bin | 11001000001000010000100… |
… | …010100011101011010100011 |
3 | 112102120000021110202101122021 |
4 | 121001002010110131122203 |
5 | 103410100231131211321 |
6 | 1025555242254522311 |
7 | 32113556154304312 |
oct | 3101020424353243 |
9 | 472500243671567 |
10 | 110022102210211 |
11 | 32069125477924 |
12 | 1040b02b506397 |
13 | 495106935bc59 |
14 | 1d251534ca279 |
15 | cabdd9cd0941 |
hex | 64108451d6a3 |
110022102210211 has 4 divisors (see below), whose sum is σ = 110022237886624. Its totient is φ = 110021966533800.
The previous prime is 110022102210203. The next prime is 110022102210221. The reversal of 110022102210211 is 112012201220011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110022102210211 - 23 = 110022102210203 is a prime.
It is a super-2 number, since 2×1100221022102112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110022102210221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66614475 + ... + 68246116.
It is an arithmetic number, because the mean of its divisors is an integer number (27505559471656).
Almost surely, 2110022102210211 is an apocalyptic number.
110022102210211 is a deficient number, since it is larger than the sum of its proper divisors (135676413).
110022102210211 is an equidigital number, since it uses as much as digits as its factorization.
110022102210211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 135676412.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 110022102210211 its reverse (112012201220011), we get a palindrome (222034303430222).
The spelling of 110022102210211 in words is "one hundred ten trillion, twenty-two billion, one hundred two million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •