Base | Representation |
---|---|
bin | 1001000111010111100110… |
… | …1111101000111100111011 |
3 | 1022111010001102202202101002 |
4 | 2101311321233220330323 |
5 | 2303200432003430321 |
6 | 33152045150315215 |
7 | 2053036326614606 |
oct | 221657157507473 |
9 | 38433042682332 |
10 | 10022201233211 |
11 | 3214434355142 |
12 | 115a452ab8b0b |
13 | 5791218a6bcb |
14 | 2691118d333d |
15 | 125a7907120b |
hex | 91d79be8f3b |
10022201233211 has 8 divisors (see below), whose sum is σ = 10199056556304. Its totient is φ = 9846147975840.
The previous prime is 10022201233181. The next prime is 10022201233241. The reversal of 10022201233211 is 11233210222001.
It is an interprime number because it is at equal distance from previous prime (10022201233181) and next prime (10022201233241).
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 10022201233211 - 210 = 10022201232187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10022201233241) 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, 200491220 + ... + 200541201.
It is an arithmetic number, because the mean of its divisors is an integer number (1274882069538).
Almost surely, 210022201233211 is an apocalyptic number.
10022201233211 is a deficient number, since it is larger than the sum of its proper divisors (176855323093).
10022201233211 is an equidigital number, since it uses as much as digits as its factorization.
10022201233211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401032861.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 10022201233211 its reverse (11233210222001), we get a palindrome (21255411455212).
The spelling of 10022201233211 in words is "ten trillion, twenty-two billion, two hundred one million, two hundred thirty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •