Base | Representation |
---|---|
bin | 1001000110000100111110… |
… | …1100110001011111100011 |
3 | 1022101222210122202021110001 |
4 | 2101201033230301133203 |
5 | 2302320020334032321 |
6 | 33133540215120431 |
7 | 2051322562016242 |
oct | 221411754613743 |
9 | 38358718667401 |
10 | 10000021002211 |
11 | 3205a92179319 |
12 | 11560a2973117 |
13 | 576cc85ccb76 |
14 | 268009c38959 |
15 | 1251cbbe0c91 |
hex | 9184fb317e3 |
10000021002211 has 4 divisors (see below), whose sum is σ = 10004217404512. Its totient is φ = 9995824599912.
The previous prime is 10000021002199. The next prime is 10000021002227. The reversal of 10000021002211 is 11220012000001.
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 10000021002211 - 221 = 10000018905059 is a prime.
It is a super-2 number, since 2×100000210022112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10000021002271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2098197576 + ... + 2098202341.
It is an arithmetic number, because the mean of its divisors is an integer number (2501054351128).
Almost surely, 210000021002211 is an apocalyptic number.
10000021002211 is a deficient number, since it is larger than the sum of its proper divisors (4196402301).
10000021002211 is an equidigital number, since it uses as much as digits as its factorization.
10000021002211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4196402300.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10000021002211 its reverse (11220012000001), we get a palindrome (21220033002212).
The spelling of 10000021002211 in words is "ten trillion, twenty-one million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •