Base | Representation |
---|---|
bin | 110011001111010001… |
… | …0110100101010100001 |
3 | 101112000110121000001112 |
4 | 1212132202310222201 |
5 | 3300322213024022 |
6 | 122314324513105 |
7 | 10643514340556 |
oct | 1463642645241 |
9 | 345013530045 |
10 | 110034111137 |
11 | 42735429335 |
12 | 193aa24b795 |
13 | a4b75b1202 |
14 | 547b942a2d |
15 | 2ce00d48e2 |
hex | 199e8b4aa1 |
110034111137 has 2 divisors, whose sum is σ = 110034111138. Its totient is φ = 110034111136.
The previous prime is 110034111091. The next prime is 110034111149. The reversal of 110034111137 is 731111430011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100554946816 + 9479164321 = 317104^2 + 97361^2 .
It is an emirp because it is prime and its reverse (731111430011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110034111137 - 216 = 110034045601 is a prime.
It is a super-4 number, since 4×1100341111374 (a number of 45 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (110034111197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55017055568 + 55017055569.
It is an arithmetic number, because the mean of its divisors is an integer number (55017055569).
Almost surely, 2110034111137 is an apocalyptic number.
It is an amenable number.
110034111137 is a deficient number, since it is larger than the sum of its proper divisors (1).
110034111137 is an equidigital number, since it uses as much as digits as its factorization.
110034111137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 252, while the sum is 23.
Adding to 110034111137 its reverse (731111430011), we get a palindrome (841145541148).
The spelling of 110034111137 in words is "one hundred ten billion, thirty-four million, one hundred eleven thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •