Base | Representation |
---|---|
bin | 111110110100101… |
… | …011100001011111 |
3 | 2201110021121021112 |
4 | 332310223201133 |
5 | 4124310402101 |
6 | 252330452235 |
7 | 35055553664 |
oct | 7664534137 |
9 | 2643247245 |
10 | 1053997151 |
11 | 4a0a54729 |
12 | 254b9407b |
13 | 13a494a6c |
14 | 9dda5a6b |
15 | 627ea6bb |
hex | 3ed2b85f |
1053997151 has 2 divisors, whose sum is σ = 1053997152. Its totient is φ = 1053997150.
The previous prime is 1053997129. The next prime is 1053997159. The reversal of 1053997151 is 1517993501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1053997151 - 210 = 1053996127 is a prime.
It is a super-2 number, since 2×10539971512 = 2221819988632233602, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1053997099 and 1053997108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1053997159) 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, 526998575 + 526998576.
It is an arithmetic number, because the mean of its divisors is an integer number (526998576).
Almost surely, 21053997151 is an apocalyptic number.
1053997151 is a deficient number, since it is larger than the sum of its proper divisors (1).
1053997151 is an equidigital number, since it uses as much as digits as its factorization.
1053997151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42525, while the sum is 41.
The square root of 1053997151 is about 32465.3222839386. The cubic root of 1053997151 is about 1017.6844664316.
The spelling of 1053997151 in words is "one billion, fifty-three million, nine hundred ninety-seven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •