Base | Representation |
---|---|
bin | 1001010010111111111101… |
… | …0010011001101110000001 |
3 | 1100012012210110121111221020 |
4 | 2110233333102121232001 |
5 | 2314434134103224301 |
6 | 33423532054220053 |
7 | 2103341641116255 |
oct | 224577722315601 |
9 | 40165713544836 |
10 | 10222010211201 |
11 | 3291148305708 |
12 | 1191116654629 |
13 | 591c154633b9 |
14 | 274a6848c265 |
15 | 12ad70861436 |
hex | 94bff499b81 |
10222010211201 has 8 divisors (see below), whose sum is σ = 13801870327680. Its totient is φ = 6728411784432.
The previous prime is 10222010211191. The next prime is 10222010211211. The reversal of 10222010211201 is 10211201022201.
It is an interprime number because it is at equal distance from previous prime (10222010211191) and next prime (10222010211211).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10222010211201 - 222 = 10222006016897 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10222010211211) 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, 21565422150 + ... + 21565422623.
It is an arithmetic number, because the mean of its divisors is an integer number (1725233790960).
Almost surely, 210222010211201 is an apocalyptic number.
It is an amenable number.
10222010211201 is a deficient number, since it is larger than the sum of its proper divisors (3579860116479).
10222010211201 is an equidigital number, since it uses as much as digits as its factorization.
10222010211201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43130844855.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10222010211201 its reverse (10211201022201), we get a palindrome (20433211233402).
The spelling of 10222010211201 in words is "ten trillion, two hundred twenty-two billion, ten million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •