Base | Representation |
---|---|
bin | 111110111101010… |
… | …001001000010101 |
3 | 2201121111222022221 |
4 | 332331101020111 |
5 | 4130344421331 |
6 | 252451022341 |
7 | 35113651141 |
oct | 7675211025 |
9 | 2647458287 |
10 | 1056248341 |
11 | 4a2252015 |
12 | 25589a9b1 |
13 | 13aaa2625 |
14 | a03d0221 |
15 | 62ae2711 |
hex | 3ef51215 |
1056248341 has 2 divisors, whose sum is σ = 1056248342. Its totient is φ = 1056248340.
The previous prime is 1056248321. The next prime is 1056248359. The reversal of 1056248341 is 1438426501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 601279441 + 454968900 = 24521^2 + 21330^2 .
It is an emirp because it is prime and its reverse (1438426501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1056248341 - 25 = 1056248309 is a prime.
It is a super-2 number, since 2×10562483412 = 2231321115730504562, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1056248297 and 1056248306.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1056248321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 528124170 + 528124171.
It is an arithmetic number, because the mean of its divisors is an integer number (528124171).
Almost surely, 21056248341 is an apocalyptic number.
It is an amenable number.
1056248341 is a deficient number, since it is larger than the sum of its proper divisors (1).
1056248341 is an equidigital number, since it uses as much as digits as its factorization.
1056248341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23040, while the sum is 34.
The square root of 1056248341 is about 32499.9744769131. The cubic root of 1056248341 is about 1018.4084949355.
The spelling of 1056248341 in words is "one billion, fifty-six million, two hundred forty-eight thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •