Base | Representation |
---|---|
bin | 110100101101101010… |
… | …0001000010110011101 |
3 | 101211012011221102100111 |
4 | 1221123110020112131 |
5 | 3323313443402222 |
6 | 124000501330021 |
7 | 11115141633211 |
oct | 1513324102635 |
9 | 354164842314 |
10 | 113201153437 |
11 | 44010111069 |
12 | 19b32a06911 |
13 | a8a0780738 |
14 | 569c3cc941 |
15 | 2e28172777 |
hex | 1a5b50859d |
113201153437 has 2 divisors, whose sum is σ = 113201153438. Its totient is φ = 113201153436.
The previous prime is 113201153411. The next prime is 113201153501. The reversal of 113201153437 is 734351102311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109928054916 + 3273098521 = 331554^2 + 57211^2 .
It is a cyclic number.
It is not a de Polignac number, because 113201153437 - 211 = 113201151389 is a prime.
It is a super-2 number, since 2×1132011534372 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113201153399 and 113201153408.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113201153837) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56600576718 + 56600576719.
It is an arithmetic number, because the mean of its divisors is an integer number (56600576719).
Almost surely, 2113201153437 is an apocalyptic number.
It is an amenable number.
113201153437 is a deficient number, since it is larger than the sum of its proper divisors (1).
113201153437 is an equidigital number, since it uses as much as digits as its factorization.
113201153437 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7560, while the sum is 31.
Adding to 113201153437 its reverse (734351102311), we get a palindrome (847552255748).
The spelling of 113201153437 in words is "one hundred thirteen billion, two hundred one million, one hundred fifty-three thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •