Base | Representation |
---|---|
bin | 11001000010011111000110… |
… | …101100010111101011000011 |
3 | 112102220120010112010001022020 |
4 | 121002133012230113223003 |
5 | 103413214324001202321 |
6 | 1030113203131412523 |
7 | 32124023550555522 |
oct | 3102370654275303 |
9 | 472816115101266 |
10 | 110122000022211 |
11 | 320a7529157631 |
12 | 1042646abb4143 |
13 | 495a5c9940008 |
14 | 1d29d0cb4a4b9 |
15 | cae7d50824c6 |
hex | 6427c6b17ac3 |
110122000022211 has 8 divisors (see below), whose sum is σ = 146831171185344. Its totient is φ = 73413747770280.
The previous prime is 110122000022159. The next prime is 110122000022231. The reversal of 110122000022211 is 112220000221011.
110122000022211 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110122000022211 - 26 = 110122000022147 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110122000022231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 229448125 + ... + 229927566.
It is an arithmetic number, because the mean of its divisors is an integer number (18353896398168).
Almost surely, 2110122000022211 is an apocalyptic number.
110122000022211 is a deficient number, since it is larger than the sum of its proper divisors (36709171163133).
110122000022211 is an equidigital number, since it uses as much as digits as its factorization.
110122000022211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 459455601.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 110122000022211 its reverse (112220000221011), we get a palindrome (222342000243222).
The spelling of 110122000022211 in words is "one hundred ten trillion, one hundred twenty-two billion, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •