Base | Representation |
---|---|
bin | 110011010100110110… |
… | …0001000110011100101 |
3 | 101112111111110010201111 |
4 | 1212221230020303211 |
5 | 3301213100233214 |
6 | 122345044425021 |
7 | 10651244624413 |
oct | 1465154106345 |
9 | 345444403644 |
10 | 110221102309 |
11 | 42820a3659a |
12 | 194409a8171 |
13 | a517262286 |
14 | 54986da2b3 |
15 | 2d0171e5c4 |
hex | 19a9b08ce5 |
110221102309 has 2 divisors, whose sum is σ = 110221102310. Its totient is φ = 110221102308.
The previous prime is 110221102291. The next prime is 110221102319. The reversal of 110221102309 is 903201122011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 78786876100 + 31434226209 = 280690^2 + 177297^2 .
It is an emirp because it is prime and its reverse (903201122011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110221102309 - 223 = 110212713701 is a prime.
It is a super-2 number, since 2×1102211023092 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110221102309.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110221102319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55110551154 + 55110551155.
It is an arithmetic number, because the mean of its divisors is an integer number (55110551155).
Almost surely, 2110221102309 is an apocalyptic number.
It is an amenable number.
110221102309 is a deficient number, since it is larger than the sum of its proper divisors (1).
110221102309 is an equidigital number, since it uses as much as digits as its factorization.
110221102309 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 22.
The spelling of 110221102309 in words is "one hundred ten billion, two hundred twenty-one million, one hundred two thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •