Base | Representation |
---|---|
bin | 110100111000001001… |
… | …1001110111111100101 |
3 | 101212002201110021100221 |
4 | 1221300103032333211 |
5 | 3330024112140122 |
6 | 124055440004341 |
7 | 11126645420566 |
oct | 1516023167745 |
9 | 355081407327 |
10 | 113553240037 |
11 | 44180930a26 |
12 | 1a0109006b1 |
13 | a9286b75c3 |
14 | 56d308016d |
15 | 2e4901e6c7 |
hex | 1a704cefe5 |
113553240037 has 2 divisors, whose sum is σ = 113553240038. Its totient is φ = 113553240036.
The previous prime is 113553240029. The next prime is 113553240077. The reversal of 113553240037 is 730042355311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70602335521 + 42950904516 = 265711^2 + 207246^2 .
It is a cyclic number.
It is not a de Polignac number, because 113553240037 - 23 = 113553240029 is a prime.
It is a super-2 number, since 2×1135532400372 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113553239984 and 113553240011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113553240077) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56776620018 + 56776620019.
It is an arithmetic number, because the mean of its divisors is an integer number (56776620019).
Almost surely, 2113553240037 is an apocalyptic number.
It is an amenable number.
113553240037 is a deficient number, since it is larger than the sum of its proper divisors (1).
113553240037 is an equidigital number, since it uses as much as digits as its factorization.
113553240037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 37800, while the sum is 34.
Adding to 113553240037 its reverse (730042355311), we get a palindrome (843595595348).
The spelling of 113553240037 in words is "one hundred thirteen billion, five hundred fifty-three million, two hundred forty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •