Base | Representation |
---|---|
bin | 110011010010001000… |
… | …1110101111001001101 |
3 | 101112021011122001221122 |
4 | 1212210101311321031 |
5 | 3301021330314041 |
6 | 122332043010325 |
7 | 10646063204645 |
oct | 1464421657115 |
9 | 345234561848 |
10 | 110130323021 |
11 | 42784772794 |
12 | 194165099a5 |
13 | a5014c9714 |
14 | 548a629525 |
15 | 2ce878bc4b |
hex | 19a4475e4d |
110130323021 has 2 divisors, whose sum is σ = 110130323022. Its totient is φ = 110130323020.
The previous prime is 110130323003. The next prime is 110130323033. The reversal of 110130323021 is 120323031011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61362225796 + 48768097225 = 247714^2 + 220835^2 .
It is an emirp because it is prime and its reverse (120323031011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110130323021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110130323041) 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 as a sum of consecutive naturals, namely, 55065161510 + 55065161511.
It is an arithmetic number, because the mean of its divisors is an integer number (55065161511).
Almost surely, 2110130323021 is an apocalyptic number.
It is an amenable number.
110130323021 is a deficient number, since it is larger than the sum of its proper divisors (1).
110130323021 is an equidigital number, since it uses as much as digits as its factorization.
110130323021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 110130323021 its reverse (120323031011), we get a palindrome (230453354032).
The spelling of 110130323021 in words is "one hundred ten billion, one hundred thirty million, three hundred twenty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •