Base | Representation |
---|---|
bin | 100010001101111… |
… | …0010111001001101 |
3 | 2222000102101220222 |
4 | 1010123302321031 |
5 | 4322410341122 |
6 | 305532321125 |
7 | 40311001205 |
oct | 10433627115 |
9 | 2860371828 |
10 | 1148137037 |
11 | 53a103393 |
12 | 2806131a5 |
13 | 153b36138 |
14 | ac6ad405 |
15 | 6abe3b42 |
hex | 446f2e4d |
1148137037 has 2 divisors, whose sum is σ = 1148137038. Its totient is φ = 1148137036.
The previous prime is 1148137033. The next prime is 1148137093. The reversal of 1148137037 is 7307318411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 899160196 + 248976841 = 29986^2 + 15779^2 .
It is an emirp because it is prime and its reverse (7307318411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1148137037 - 22 = 1148137033 is a prime.
It is a super-2 number, since 2×11481370372 = 2636437311462278738, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1148136988 and 1148137006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1148137033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 574068518 + 574068519.
It is an arithmetic number, because the mean of its divisors is an integer number (574068519).
Almost surely, 21148137037 is an apocalyptic number.
It is an amenable number.
1148137037 is a deficient number, since it is larger than the sum of its proper divisors (1).
1148137037 is an equidigital number, since it uses as much as digits as its factorization.
1148137037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14112, while the sum is 35.
The square root of 1148137037 is about 33884.1708914354. The cubic root of 1148137037 is about 1047.1235062797.
The spelling of 1148137037 in words is "one billion, one hundred forty-eight million, one hundred thirty-seven thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •