Base | Representation |
---|---|
bin | 10000001001110111001… |
… | …111111001110110111011 |
3 | 10221010100221011201122011 |
4 | 100021313033321312323 |
5 | 121141442132021334 |
6 | 2205550211110351 |
7 | 143126240116426 |
oct | 20116717716673 |
9 | 3833327151564 |
10 | 1110102220219 |
11 | 398878843623 |
12 | 15b18aba23b7 |
13 | 808b3a05985 |
14 | 3ba2d0389bd |
15 | 1dd22801564 |
hex | 102773f9dbb |
1110102220219 has 8 divisors (see below), whose sum is σ = 1117260529920. Its totient is φ = 1102957934400.
The previous prime is 1110102220169. The next prime is 1110102220223. The reversal of 1110102220219 is 9120222010111.
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 1110102220219 - 213 = 1110102212027 is a prime.
It is a super-3 number, since 3×11101022202193 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1110102220219.
It is not an unprimeable number, because it can be changed into a prime (1110102220819) 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, 3347122 + ... + 3663799.
It is an arithmetic number, because the mean of its divisors is an integer number (139657566240).
Almost surely, 21110102220219 is an apocalyptic number.
1110102220219 is a deficient number, since it is larger than the sum of its proper divisors (7158309701).
1110102220219 is an equidigital number, since it uses as much as digits as its factorization.
1110102220219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7011941.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 1110102220219 in words is "one trillion, one hundred ten billion, one hundred two million, two hundred twenty thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •