Base | Representation |
---|---|
bin | 11101001010101111100… |
… | …10011100101000001101 |
3 | 10112210212001112021221221 |
4 | 32211113302130220031 |
5 | 112410001224102341 |
6 | 2044223204523341 |
7 | 132256312222042 |
oct | 16452762345015 |
9 | 3483761467857 |
10 | 1002200222221 |
11 | 357037997470 |
12 | 1422969b0551 |
13 | 73679077393 |
14 | 367147411c9 |
15 | 1b1099c8ed1 |
hex | e957c9ca0d |
1002200222221 has 16 divisors (see below), whose sum is σ = 1095667560000. Its totient is φ = 909126489600.
The previous prime is 1002200222203. The next prime is 1002200222227. The reversal of 1002200222221 is 1222220022001.
It is a cyclic number.
It is not a de Polignac number, because 1002200222221 - 233 = 993610287629 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1002200222195 and 1002200222204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002200222227) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 57785011 + ... + 57802351.
It is an arithmetic number, because the mean of its divisors is an integer number (68479222500).
Almost surely, 21002200222221 is an apocalyptic number.
1002200222221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1002200222221 is a deficient number, since it is larger than the sum of its proper divisors (93467337779).
1002200222221 is a wasteful number, since it uses less digits than its factorization.
1002200222221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28380.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 1002200222221 its reverse (1222220022001), we get a palindrome (2224420244222).
The spelling of 1002200222221 in words is "one trillion, two billion, two hundred million, two hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •