Base | Representation |
---|---|
bin | 100010001000001… |
… | …0001001111011101 |
3 | 2221210201220022101 |
4 | 1010100101033131 |
5 | 4321122144423 |
6 | 305343445101 |
7 | 40243215325 |
oct | 10420211735 |
9 | 2853656271 |
10 | 1145115613 |
11 | 53842a344 |
12 | 27b5b6791 |
13 | 153318b05 |
14 | ac124285 |
15 | 6a7e87ad |
hex | 444113dd |
1145115613 has 2 divisors, whose sum is σ = 1145115614. Its totient is φ = 1145115612.
The previous prime is 1145115611. The next prime is 1145115637. The reversal of 1145115613 is 3165115411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1131851449 + 13264164 = 33643^2 + 3642^2 .
It is a cyclic number.
It is not a de Polignac number, because 1145115613 - 21 = 1145115611 is a prime.
It is a super-2 number, since 2×11451156132 = 2622579534272731538, which contains 22 as substring.
Together with 1145115611, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1145115611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 572557806 + 572557807.
It is an arithmetic number, because the mean of its divisors is an integer number (572557807).
Almost surely, 21145115613 is an apocalyptic number.
It is an amenable number.
1145115613 is a deficient number, since it is larger than the sum of its proper divisors (1).
1145115613 is an equidigital number, since it uses as much as digits as its factorization.
1145115613 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1800, while the sum is 28.
The square root of 1145115613 is about 33839.5569267684. The cubic root of 1145115613 is about 1046.2041667084.
The spelling of 1145115613 in words is "one billion, one hundred forty-five million, one hundred fifteen thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •