Base | Representation |
---|---|
bin | 1001000110001101001011… |
… | …0001110000000001100011 |
3 | 1022102012110220210010221221 |
4 | 2101203102301300001203 |
5 | 2302334021322402321 |
6 | 33134542333555511 |
7 | 2051431224151642 |
oct | 221432261600143 |
9 | 38365426703857 |
10 | 10002220122211 |
11 | 3206a10557769 |
12 | 11565b7345b97 |
13 | 5772890b3ac5 |
14 | 268177d27359 |
15 | 1252a9cd6e41 |
hex | 918d2c70063 |
10002220122211 has 4 divisors (see below), whose sum is σ = 10105335793672. Its totient is φ = 9899104450752.
The previous prime is 10002220122203. The next prime is 10002220122253. The reversal of 10002220122211 is 11222102220001.
It is a happy number.
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 10002220122211 - 23 = 10002220122203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10002220122281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 51557835585 + ... + 51557835778.
It is an arithmetic number, because the mean of its divisors is an integer number (2526333948418).
Almost surely, 210002220122211 is an apocalyptic number.
10002220122211 is a deficient number, since it is larger than the sum of its proper divisors (103115671461).
10002220122211 is an equidigital number, since it uses as much as digits as its factorization.
10002220122211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103115671460.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 10002220122211 its reverse (11222102220001), we get a palindrome (21224322342212).
The spelling of 10002220122211 in words is "ten trillion, two billion, two hundred twenty million, one hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •