Base | Representation |
---|---|
bin | 110100101000010100… |
… | …0101110011101011101 |
3 | 101210201200211122012111 |
4 | 1221100220232131131 |
5 | 3322432113044122 |
6 | 123531021434021 |
7 | 11110535113636 |
oct | 1512050563535 |
9 | 353650748174 |
10 | 113022003037 |
11 | 43a28a79789 |
12 | 19aa2a0b911 |
13 | a872616498 |
14 | 56826b688d |
15 | 2e17585d77 |
hex | 1a50a2e75d |
113022003037 has 2 divisors, whose sum is σ = 113022003038. Its totient is φ = 113022003036.
The previous prime is 113022003011. The next prime is 113022003071. The reversal of 113022003037 is 730300220311.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 91888403161 + 21133599876 = 303131^2 + 145374^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113022003037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113022002999 and 113022003017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113022003007) 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, 56511001518 + 56511001519.
It is an arithmetic number, because the mean of its divisors is an integer number (56511001519).
Almost surely, 2113022003037 is an apocalyptic number.
It is an amenable number.
113022003037 is a deficient number, since it is larger than the sum of its proper divisors (1).
113022003037 is an equidigital number, since it uses as much as digits as its factorization.
113022003037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 22.
Adding to 113022003037 its reverse (730300220311), we get a palindrome (843322223348).
The spelling of 113022003037 in words is "one hundred thirteen billion, twenty-two million, three thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •