Base | Representation |
---|---|
bin | 100010010001110… |
… | …1101111111111001 |
3 | 2222011022221011121 |
4 | 1010203231333321 |
5 | 4323423323022 |
6 | 310045025241 |
7 | 40334441662 |
oct | 10443557771 |
9 | 2864287147 |
10 | 1150214137 |
11 | 5402a19a6 |
12 | 281255221 |
13 | 1543b26a7 |
14 | aca90369 |
15 | 6aea42c7 |
hex | 448edff9 |
1150214137 has 2 divisors, whose sum is σ = 1150214138. Its totient is φ = 1150214136.
The previous prime is 1150214113. The next prime is 1150214161. The reversal of 1150214137 is 7314120511.
It is a balanced prime because it is at equal distance from previous prime (1150214113) and next prime (1150214161).
It can be written as a sum of positive squares in only one way, i.e., 948886416 + 201327721 = 30804^2 + 14189^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1150214137 is a prime.
It is not a weakly prime, because it can be changed into another prime (1150214437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 575107068 + 575107069.
It is an arithmetic number, because the mean of its divisors is an integer number (575107069).
Almost surely, 21150214137 is an apocalyptic number.
It is an amenable number.
1150214137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1150214137 is an equidigital number, since it uses as much as digits as its factorization.
1150214137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 840, while the sum is 25.
The square root of 1150214137 is about 33914.8070464805. The cubic root of 1150214137 is about 1047.7545778598.
Adding to 1150214137 its reverse (7314120511), we get a palindrome (8464334648).
The spelling of 1150214137 in words is "one billion, one hundred fifty million, two hundred fourteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •