Base | Representation |
---|---|
bin | 111110111101010… |
… | …001010001110111 |
3 | 2201121112000011112 |
4 | 332331101101313 |
5 | 4130344431301 |
6 | 252451025235 |
7 | 35113653002 |
oct | 7675212167 |
9 | 2647460145 |
10 | 1056248951 |
11 | 4a225251a |
12 | 25589b21b |
13 | 13aaa29a4 |
14 | a03d0539 |
15 | 62ae29bb |
hex | 3ef51477 |
1056248951 has 2 divisors, whose sum is σ = 1056248952. Its totient is φ = 1056248950.
The previous prime is 1056248927. The next prime is 1056248959. The reversal of 1056248951 is 1598426501.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1056248951 is a prime.
It is a super-2 number, since 2×10562489512 = 2231323692977200802, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1056248899 and 1056248908.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1056248959) 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, 528124475 + 528124476.
It is an arithmetic number, because the mean of its divisors is an integer number (528124476).
Almost surely, 21056248951 is an apocalyptic number.
1056248951 is a deficient number, since it is larger than the sum of its proper divisors (1).
1056248951 is an equidigital number, since it uses as much as digits as its factorization.
1056248951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 86400, while the sum is 41.
The square root of 1056248951 is about 32499.9838615345. The cubic root of 1056248951 is about 1018.4086909844.
The spelling of 1056248951 in words is "one billion, fifty-six million, two hundred forty-eight thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •