Base | Representation |
---|---|
bin | 100010001000000… |
… | …1101110011001001 |
3 | 2221210201011222011 |
4 | 1010100031303021 |
5 | 4321121222023 |
6 | 305343255521 |
7 | 40243126243 |
oct | 10420156311 |
9 | 2853634864 |
10 | 1145101513 |
11 | 53841a796 |
12 | 27b5aa5a1 |
13 | 15331257a |
14 | ac11d093 |
15 | 6a7e450d |
hex | 4440dcc9 |
1145101513 has 2 divisors, whose sum is σ = 1145101514. Its totient is φ = 1145101512.
The previous prime is 1145101471. The next prime is 1145101537. The reversal of 1145101513 is 3151015411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 861246409 + 283855104 = 29347^2 + 16848^2 .
It is an emirp because it is prime and its reverse (3151015411) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1145101513 is a prime.
It is a super-2 number, since 2×11451015132 = 2622514950149778338, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1145101553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 572550756 + 572550757.
It is an arithmetic number, because the mean of its divisors is an integer number (572550757).
Almost surely, 21145101513 is an apocalyptic number.
It is an amenable number.
1145101513 is a deficient number, since it is larger than the sum of its proper divisors (1).
1145101513 is an equidigital number, since it uses as much as digits as its factorization.
1145101513 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 300, while the sum is 22.
The square root of 1145101513 is about 33839.3485900660. The cubic root of 1145101513 is about 1046.1998726618.
Adding to 1145101513 its reverse (3151015411), we get a palindrome (4296116924).
The spelling of 1145101513 in words is "one billion, one hundred forty-five million, one hundred one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •