Base | Representation |
---|---|
bin | 100010001110111… |
… | …1110100100001011 |
3 | 2222001111110200122 |
4 | 1010131332210023 |
5 | 4323032143011 |
6 | 305552453455 |
7 | 40315603133 |
oct | 10435764413 |
9 | 2861443618 |
10 | 1148709131 |
11 | 53a464199 |
12 | 28084a28b |
13 | 153ca665b |
14 | ac7bbac3 |
15 | 6aca83db |
hex | 4477e90b |
1148709131 has 2 divisors, whose sum is σ = 1148709132. Its totient is φ = 1148709130.
The previous prime is 1148709103. The next prime is 1148709143. The reversal of 1148709131 is 1319078411.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1148709131 - 230 = 74967307 is a prime.
It is a super-2 number, since 2×11487091312 = 2639065335285550322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1148709091 and 1148709100.
It is not a weakly prime, because it can be changed into another prime (1148702131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 574354565 + 574354566.
It is an arithmetic number, because the mean of its divisors is an integer number (574354566).
Almost surely, 21148709131 is an apocalyptic number.
1148709131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1148709131 is an equidigital number, since it uses as much as digits as its factorization.
1148709131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6048, while the sum is 35.
The square root of 1148709131 is about 33892.6117465149. The cubic root of 1148709131 is about 1047.2973977185.
The spelling of 1148709131 in words is "one billion, one hundred forty-eight million, seven hundred nine thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •