Base | Representation |
---|---|
bin | 1001010011000000010010… |
… | …1101001100010001101111 |
3 | 1100012020000210200011111220 |
4 | 2110300010231030101233 |
5 | 2314434330341320421 |
6 | 33423545102514423 |
7 | 2103344123615646 |
oct | 224600455142157 |
9 | 40166023604456 |
10 | 10222101120111 |
11 | 3291194657941 |
12 | 1191140b95a13 |
13 | 591c2b242c5a |
14 | 274a7659435d |
15 | 12ad7881c3c6 |
hex | 94c04b4c46f |
10222101120111 has 4 divisors (see below), whose sum is σ = 13629468160152. Its totient is φ = 6814734080072.
The previous prime is 10222101120103. The next prime is 10222101120131. The reversal of 10222101120111 is 11102110122201.
It is a happy number.
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 10222101120111 - 23 = 10222101120103 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10222101120131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1703683520016 + ... + 1703683520021.
It is an arithmetic number, because the mean of its divisors is an integer number (3407367040038).
Almost surely, 210222101120111 is an apocalyptic number.
10222101120111 is a deficient number, since it is larger than the sum of its proper divisors (3407367040041).
10222101120111 is an equidigital number, since it uses as much as digits as its factorization.
10222101120111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3407367040040.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10222101120111 its reverse (11102110122201), we get a palindrome (21324211242312).
The spelling of 10222101120111 in words is "ten trillion, two hundred twenty-two billion, one hundred one million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •