Base | Representation |
---|---|
bin | 11001000001000001111111… |
… | …011111000110000110011011 |
3 | 112102120000001211011012002221 |
4 | 121001001333133012012123 |
5 | 103410100044401042334 |
6 | 1025555230240404511 |
7 | 32113554151056106 |
oct | 3101017737060633 |
9 | 472500054135087 |
10 | 110022021112219 |
11 | 32069093716797 |
12 | 1040b008316737 |
13 | 4951055605b88 |
14 | 1d2514681973d |
15 | cabdd2b118b4 |
hex | 64107f7c619b |
110022021112219 has 4 divisors (see below), whose sum is σ = 110022258871800. Its totient is φ = 110021783352640.
The previous prime is 110022021112207. The next prime is 110022021112279. The reversal of 110022021112219 is 912211120220011.
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 110022021112219 - 219 = 110022020587931 is a prime.
It is a super-2 number, since 2×1100220211122192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110022021112193 and 110022021112202.
It is not an unprimeable number, because it can be changed into a prime (110022021112279) 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, 118184317 + ... + 119111614.
It is an arithmetic number, because the mean of its divisors is an integer number (27505564717950).
Almost surely, 2110022021112219 is an apocalyptic number.
110022021112219 is a deficient number, since it is larger than the sum of its proper divisors (237759581).
110022021112219 is an equidigital number, since it uses as much as digits as its factorization.
110022021112219 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 237759580.
The product of its (nonzero) digits is 288, while the sum is 25.
The spelling of 110022021112219 in words is "one hundred ten trillion, twenty-two billion, twenty-one million, one hundred twelve thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •