Base | Representation |
---|---|
bin | 100010010010011… |
… | …0111011101000101 |
3 | 2222011220012220011 |
4 | 1010210313131011 |
5 | 4324012440023 |
6 | 310055310221 |
7 | 40340134114 |
oct | 10444673505 |
9 | 2864805804 |
10 | 1150515013 |
11 | 540487a5a |
12 | 28137b371 |
13 | 15448961b |
14 | acb2bc7b |
15 | 6b01350d |
hex | 44937745 |
1150515013 has 2 divisors, whose sum is σ = 1150515014. Its totient is φ = 1150515012.
The previous prime is 1150514983. The next prime is 1150515017. The reversal of 1150515013 is 3105150511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1130102689 + 20412324 = 33617^2 + 4518^2 .
It is an emirp because it is prime and its reverse (3105150511) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1150515013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1150515017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 575257506 + 575257507.
It is an arithmetic number, because the mean of its divisors is an integer number (575257507).
Almost surely, 21150515013 is an apocalyptic number.
It is an amenable number.
1150515013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1150515013 is an equidigital number, since it uses as much as digits as its factorization.
1150515013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 375, while the sum is 22.
The square root of 1150515013 is about 33919.2425180752. The cubic root of 1150515013 is about 1047.8459280159.
Adding to 1150515013 its reverse (3105150511), we get a palindrome (4255665524).
The spelling of 1150515013 in words is "one billion, one hundred fifty million, five hundred fifteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •