Base | Representation |
---|---|
bin | 100010000111111… |
… | …1000010110000101 |
3 | 2221210112201102111 |
4 | 1010033320112011 |
5 | 4321110414022 |
6 | 305341341021 |
7 | 40242312115 |
oct | 10417702605 |
9 | 2853481374 |
10 | 1145013637 |
11 | 53836a769 |
12 | 27b567771 |
13 | 1532b1581 |
14 | ac0d9045 |
15 | 6a7c8477 |
hex | 443f8585 |
1145013637 has 2 divisors, whose sum is σ = 1145013638. Its totient is φ = 1145013636.
The previous prime is 1145013599. The next prime is 1145013659. The reversal of 1145013637 is 7363105411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1140683076 + 4330561 = 33774^2 + 2081^2 .
It is an emirp because it is prime and its reverse (7363105411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1145013637 - 219 = 1144489349 is a prime.
It is a super-2 number, since 2×11450136372 = 2622112457831935538, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1145013599 and 1145013608.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1145013677) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 572506818 + 572506819.
It is an arithmetic number, because the mean of its divisors is an integer number (572506819).
Almost surely, 21145013637 is an apocalyptic number.
It is an amenable number.
1145013637 is a deficient number, since it is larger than the sum of its proper divisors (1).
1145013637 is an equidigital number, since it uses as much as digits as its factorization.
1145013637 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.
The square root of 1145013637 is about 33838.0501359047. The cubic root of 1145013637 is about 1046.1731099074.
The spelling of 1145013637 in words is "one billion, one hundred forty-five million, thirteen thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •