Base | Representation |
---|---|
bin | 110011010010001001… |
… | …0010010111111111101 |
3 | 101112021011212010111001 |
4 | 1212210102102333331 |
5 | 3301021343122422 |
6 | 122332045330301 |
7 | 10646064212344 |
oct | 1464422227775 |
9 | 345234763431 |
10 | 110130442237 |
11 | 42784844312 |
12 | 19416566991 |
13 | a50153ba6a |
14 | 548a65ab5b |
15 | 2ce87b2227 |
hex | 19a4492ffd |
110130442237 has 2 divisors, whose sum is σ = 110130442238. Its totient is φ = 110130442236.
The previous prime is 110130442157. The next prime is 110130442291. The reversal of 110130442237 is 732244031011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 62329616281 + 47800825956 = 249659^2 + 218634^2 .
It is an emirp because it is prime and its reverse (732244031011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110130442237 - 215 = 110130409469 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110130442297) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55065221118 + 55065221119.
It is an arithmetic number, because the mean of its divisors is an integer number (55065221119).
Almost surely, 2110130442237 is an apocalyptic number.
It is an amenable number.
110130442237 is a deficient number, since it is larger than the sum of its proper divisors (1).
110130442237 is an equidigital number, since it uses as much as digits as its factorization.
110130442237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 28.
Adding to 110130442237 its reverse (732244031011), we get a palindrome (842374473248).
The spelling of 110130442237 in words is "one hundred ten billion, one hundred thirty million, four hundred forty-two thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •