Base | Representation |
---|---|
bin | 110100110100011010… |
… | …1100000101000001101 |
3 | 101211202222210210112111 |
4 | 1221220311200220031 |
5 | 3324300032214222 |
6 | 124035203504021 |
7 | 11123565104143 |
oct | 1515065405015 |
9 | 354688723474 |
10 | 113428007437 |
11 | 44117175908 |
12 | 19b96988011 |
13 | a90877aa84 |
14 | 56c05a1593 |
15 | 2e3d033777 |
hex | 1a68d60a0d |
113428007437 has 2 divisors, whose sum is σ = 113428007438. Its totient is φ = 113428007436.
The previous prime is 113428007423. The next prime is 113428007449. The reversal of 113428007437 is 734700824311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 75174124041 + 38253883396 = 274179^2 + 195586^2 .
It is an emirp because it is prime and its reverse (734700824311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 113428007437 - 219 = 113427483149 is a prime.
It is a super-2 number, since 2×1134280074372 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 113428007437.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113428007137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56714003718 + 56714003719.
It is an arithmetic number, because the mean of its divisors is an integer number (56714003719).
Almost surely, 2113428007437 is an apocalyptic number.
It is an amenable number.
113428007437 is a deficient number, since it is larger than the sum of its proper divisors (1).
113428007437 is an equidigital number, since it uses as much as digits as its factorization.
113428007437 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 112896, while the sum is 40.
The spelling of 113428007437 in words is "one hundred thirteen billion, four hundred twenty-eight million, seven thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •