Base | Representation |
---|---|
bin | 11001000011111011011001… |
… | …100101011100100001110111 |
3 | 112110021000221001111121110111 |
4 | 121003323121211130201313 |
5 | 103421330303403101012 |
6 | 1030230512550203451 |
7 | 32134132432063336 |
oct | 3103733145344167 |
9 | 473230831447414 |
10 | 110221101222007 |
11 | 321355631aa846 |
12 | 10441707953587 |
13 | 4966a611861c9 |
14 | 1d30a30683d1d |
15 | cb218542aba7 |
hex | 643ed995c877 |
110221101222007 has 2 divisors, whose sum is σ = 110221101222008. Its totient is φ = 110221101222006.
The previous prime is 110221101221983. The next prime is 110221101222031. The reversal of 110221101222007 is 700222101122011.
It is a balanced prime because it is at equal distance from previous prime (110221101221983) and next prime (110221101222031).
It is a cyclic number.
It is not a de Polignac number, because 110221101222007 - 211 = 110221101219959 is a prime.
It is a super-2 number, since 2×1102211012220072 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110221101222077) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55110550611003 + 55110550611004.
It is an arithmetic number, because the mean of its divisors is an integer number (55110550611004).
Almost surely, 2110221101222007 is an apocalyptic number.
110221101222007 is a deficient number, since it is larger than the sum of its proper divisors (1).
110221101222007 is an equidigital number, since it uses as much as digits as its factorization.
110221101222007 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 110221101222007 its reverse (700222101122011), we get a palindrome (810443202344018).
The spelling of 110221101222007 in words is "one hundred ten trillion, two hundred twenty-one billion, one hundred one million, two hundred twenty-two thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •