Base | Representation |
---|---|
bin | 1001010011000000010010… |
… | …1000111010110101101111 |
3 | 1100012020000201120021011102 |
4 | 2110300010220322311233 |
5 | 2314434330100000421 |
6 | 33423545022513315 |
7 | 2103344111242436 |
oct | 224600450726557 |
9 | 40166021507142 |
10 | 10222100000111 |
11 | 3291193a6241a |
12 | 119114073583b |
13 | 591c2ac4022c |
14 | 274a7638211d |
15 | 12ad7869a60b |
hex | 94c04a3ad6f |
10222100000111 has 8 divisors (see below), whose sum is σ = 10226272470480. Its totient is φ = 10217928232512.
The previous prime is 10222100000023. The next prime is 10222100000113. The reversal of 10222100000111 is 11100000122201.
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 10222100000111 - 210 = 10222099999087 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10222100000092 and 10222100000101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10222100000113) 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, 29968721 + ... + 30307893.
It is an arithmetic number, because the mean of its divisors is an integer number (1278284058810).
Almost surely, 210222100000111 is an apocalyptic number.
10222100000111 is a deficient number, since it is larger than the sum of its proper divisors (4172470369).
10222100000111 is an equidigital number, since it uses as much as digits as its factorization.
10222100000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 351385.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10222100000111 its reverse (11100000122201), we get a palindrome (21322100122312).
The spelling of 10222100000111 in words is "ten trillion, two hundred twenty-two billion, one hundred million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •