Base | Representation |
---|---|
bin | 110011001110100011… |
… | …1000010100111011101 |
3 | 101111221210022121210201 |
4 | 1212131013002213131 |
5 | 3300300033113122 |
6 | 122312105103501 |
7 | 10643103001525 |
oct | 1463507024735 |
9 | 344853277721 |
10 | 110010051037 |
11 | 42722895657 |
12 | 193a2187b91 |
13 | a4b2608a73 |
14 | 547867c685 |
15 | 2cdce30a27 |
hex | 199d1c29dd |
110010051037 has 2 divisors, whose sum is σ = 110010051038. Its totient is φ = 110010051036.
The previous prime is 110010051023. The next prime is 110010051059. The reversal of 110010051037 is 730150010011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109570268196 + 439782841 = 331014^2 + 20971^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110010051037 is a prime.
It is a super-2 number, since 2×1100100510372 (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 (110010051017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005025518 + 55005025519.
It is an arithmetic number, because the mean of its divisors is an integer number (55005025519).
Almost surely, 2110010051037 is an apocalyptic number.
It is an amenable number.
110010051037 is a deficient number, since it is larger than the sum of its proper divisors (1).
110010051037 is an equidigital number, since it uses as much as digits as its factorization.
110010051037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 105, while the sum is 19.
Adding to 110010051037 its reverse (730150010011), we get a palindrome (840160061048).
The spelling of 110010051037 in words is "one hundred ten billion, ten million, fifty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •