Base | Representation |
---|---|
bin | 110011010001110110… |
… | …0000110111010011101 |
3 | 101112020111000112000011 |
4 | 1212203230012322131 |
5 | 3301011312300021 |
6 | 122331051003221 |
7 | 10645613136001 |
oct | 1464354067235 |
9 | 345214015004 |
10 | 110120431261 |
11 | 4277a126985 |
12 | 19413139511 |
13 | a4cc4451c9 |
14 | 54891b2701 |
15 | 2ce7985de1 |
hex | 19a3b06e9d |
110120431261 has 2 divisors, whose sum is σ = 110120431262. Its totient is φ = 110120431260.
The previous prime is 110120431181. The next prime is 110120431357. The reversal of 110120431261 is 162134021011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102004223161 + 8116208100 = 319381^2 + 90090^2 .
It is an emirp because it is prime and its reverse (162134021011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110120431261 - 219 = 110119906973 is a prime.
It is a super-2 number, since 2×1101204312612 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110120431061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55060215630 + 55060215631.
It is an arithmetic number, because the mean of its divisors is an integer number (55060215631).
Almost surely, 2110120431261 is an apocalyptic number.
It is an amenable number.
110120431261 is a deficient number, since it is larger than the sum of its proper divisors (1).
110120431261 is an equidigital number, since it uses as much as digits as its factorization.
110120431261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 110120431261 its reverse (162134021011), we get a palindrome (272254452272).
The spelling of 110120431261 in words is "one hundred ten billion, one hundred twenty million, four hundred thirty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •