Base | Representation |
---|---|
bin | 10001110010001010111… |
… | …101001010000111101110 |
3 | 11022211110101112001022010 |
4 | 101302022331022013232 |
5 | 130010331103000420 |
6 | 2333231555102050 |
7 | 154202553414105 |
oct | 21621275120756 |
9 | 4284411461263 |
10 | 1222102000110 |
11 | 43132179a992 |
12 | 178a275a1926 |
13 | 8b322600994 |
14 | 43215a5b03c |
15 | 21bca2664e0 |
hex | 11c8af4a1ee |
1222102000110 has 128 divisors (see below), whose sum is σ = 3078803312640. Its totient is φ = 309872009216.
The previous prime is 1222102000019. The next prime is 1222102000283. The reversal of 1222102000110 is 110002012221.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 97785382 + ... + 97797878.
It is an arithmetic number, because the mean of its divisors is an integer number (24053150880).
Almost surely, 21222102000110 is an apocalyptic number.
1222102000110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1222102000110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1539401656320).
1222102000110 is an abundant number, since it is smaller than the sum of its proper divisors (1856701312530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1222102000110 is a wasteful number, since it uses less digits than its factorization.
1222102000110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13362.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1222102000110 its reverse (110002012221), we get a palindrome (1332104012331).
The spelling of 1222102000110 in words is "one trillion, two hundred twenty-two billion, one hundred two million, one hundred ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.674 sec. • engine limits •