Base | Representation |
---|---|
bin | 1001010010111111111010… |
… | …1100001110000111011001 |
3 | 1100012012202202210000011112 |
4 | 2110233332230032013121 |
5 | 2314434124022432301 |
6 | 33423531055510105 |
7 | 2103341460051434 |
oct | 224577654160731 |
9 | 40165682700145 |
10 | 10222000202201 |
11 | 3291142699807 |
12 | 1191113228335 |
13 | 591c1336a708 |
14 | 274a6700481b |
15 | 12ad6ea359bb |
hex | 94bfeb0e1d9 |
10222000202201 has 4 divisors (see below), whose sum is σ = 10222006625232. Its totient is φ = 10221993779172.
The previous prime is 10222000202171. The next prime is 10222000202311. The reversal of 10222000202201 is 10220200022201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10222000202201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10222000232201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1151210 + ... + 4665756.
It is an arithmetic number, because the mean of its divisors is an integer number (2555501656308).
Almost surely, 210222000202201 is an apocalyptic number.
It is an amenable number.
10222000202201 is a deficient number, since it is larger than the sum of its proper divisors (6423031).
10222000202201 is an equidigital number, since it uses as much as digits as its factorization.
10222000202201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6423030.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 10222000202201 its reverse (10220200022201), we get a palindrome (20442200224402).
The spelling of 10222000202201 in words is "ten trillion, two hundred twenty-two billion, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •