Base | Representation |
---|---|
bin | 100010001000100… |
… | …1010100010101001 |
3 | 2221211011211020222 |
4 | 1010101022202221 |
5 | 4321202202223 |
6 | 305352455425 |
7 | 40245213512 |
oct | 10421124251 |
9 | 2854154228 |
10 | 1145350313 |
11 | 53857a708 |
12 | 27b6aa575 |
13 | 15339b8a3 |
14 | ac185a09 |
15 | 6a8430c8 |
hex | 4444a8a9 |
1145350313 has 2 divisors, whose sum is σ = 1145350314. Its totient is φ = 1145350312.
The previous prime is 1145350301. The next prime is 1145350321. The reversal of 1145350313 is 3130535411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1094484889 + 50865424 = 33083^2 + 7132^2 .
It is an emirp because it is prime and its reverse (3130535411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1145350313 - 230 = 71608489 is a prime.
It is not a weakly prime, because it can be changed into another prime (1145350373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 572675156 + 572675157.
It is an arithmetic number, because the mean of its divisors is an integer number (572675157).
Almost surely, 21145350313 is an apocalyptic number.
It is an amenable number.
1145350313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1145350313 is an equidigital number, since it uses as much as digits as its factorization.
1145350313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 26.
The square root of 1145350313 is about 33843.0245841000. The cubic root of 1145350313 is about 1046.2756376125.
Adding to 1145350313 its reverse (3130535411), we get a palindrome (4275885724).
The spelling of 1145350313 in words is "one billion, one hundred forty-five million, three hundred fifty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •