Base | Representation |
---|---|
bin | 110011001110010110… |
… | …0101000111101101101 |
3 | 101111221022022000020012 |
4 | 1212130230220331231 |
5 | 3300241300131341 |
6 | 122311300503005 |
7 | 10642660115315 |
oct | 1463454507555 |
9 | 344838260205 |
10 | 110003130221 |
11 | 42719998976 |
12 | 1939b9aaa65 |
13 | a4b10548ca |
14 | 547779a445 |
15 | 2cdc5150eb |
hex | 199cb28f6d |
110003130221 has 2 divisors, whose sum is σ = 110003130222. Its totient is φ = 110003130220.
The previous prime is 110003130197. The next prime is 110003130241. The reversal of 110003130221 is 122031300011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 81039855625 + 28963274596 = 284675^2 + 170186^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110003130221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110003130196 and 110003130205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110003130241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55001565110 + 55001565111.
It is an arithmetic number, because the mean of its divisors is an integer number (55001565111).
Almost surely, 2110003130221 is an apocalyptic number.
It is an amenable number.
110003130221 is a deficient number, since it is larger than the sum of its proper divisors (1).
110003130221 is an equidigital number, since it uses as much as digits as its factorization.
110003130221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 110003130221 its reverse (122031300011), we get a palindrome (232034430232).
The spelling of 110003130221 in words is "one hundred ten billion, three million, one hundred thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •