Base | Representation |
---|---|
bin | 100010010010000… |
… | …1100001100010101 |
3 | 2222011120012211012 |
4 | 1010210030030111 |
5 | 4323441302223 |
6 | 310051422005 |
7 | 40335465362 |
oct | 10444141425 |
9 | 2864505735 |
10 | 1150337813 |
11 | 540376909 |
12 | 2812b4905 |
13 | 154426a81 |
14 | acac3469 |
15 | 6aecac78 |
hex | 4490c315 |
1150337813 has 2 divisors, whose sum is σ = 1150337814. Its totient is φ = 1150337812.
The previous prime is 1150337791. The next prime is 1150337833. The reversal of 1150337813 is 3187330511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 774675889 + 375661924 = 27833^2 + 19382^2 .
It is a cyclic number.
It is not a de Polignac number, because 1150337813 - 28 = 1150337557 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1150337813.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1150337833) 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, 575168906 + 575168907.
It is an arithmetic number, because the mean of its divisors is an integer number (575168907).
Almost surely, 21150337813 is an apocalyptic number.
It is an amenable number.
1150337813 is a deficient number, since it is larger than the sum of its proper divisors (1).
1150337813 is an equidigital number, since it uses as much as digits as its factorization.
1150337813 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 32.
The square root of 1150337813 is about 33916.6303308569. The cubic root of 1150337813 is about 1047.7921295489.
The spelling of 1150337813 in words is "one billion, one hundred fifty million, three hundred thirty-seven thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •