Base | Representation |
---|---|
bin | 100010001010000… |
… | …1001010000111001 |
3 | 2221212122111212022 |
4 | 1010110021100321 |
5 | 4321402202023 |
6 | 305421324225 |
7 | 40254646202 |
oct | 10424112071 |
9 | 2855574768 |
10 | 1146131513 |
11 | 538a6362a |
12 | 27ba06675 |
13 | 1535b3337 |
14 | ac30a5a9 |
15 | 6a9497c8 |
hex | 44509439 |
1146131513 has 2 divisors, whose sum is σ = 1146131514. Its totient is φ = 1146131512.
The previous prime is 1146131477. The next prime is 1146131549. The reversal of 1146131513 is 3151316411.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (1146131477) and next prime (1146131549).
It can be written as a sum of positive squares in only one way, i.e., 1068832249 + 77299264 = 32693^2 + 8792^2 .
It is a cyclic number.
It is not a de Polignac number, because 1146131513 - 218 = 1145869369 is a prime.
It is not a weakly prime, because it can be changed into another prime (1146131593) 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, 573065756 + 573065757.
It is an arithmetic number, because the mean of its divisors is an integer number (573065757).
Almost surely, 21146131513 is an apocalyptic number.
It is an amenable number.
1146131513 is a deficient number, since it is larger than the sum of its proper divisors (1).
1146131513 is an equidigital number, since it uses as much as digits as its factorization.
1146131513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1080, while the sum is 26.
The square root of 1146131513 is about 33854.5641383847. The cubic root of 1146131513 is about 1046.5134585252.
Adding to 1146131513 its reverse (3151316411), we get a palindrome (4297447924).
The spelling of 1146131513 in words is "one billion, one hundred forty-six million, one hundred thirty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •