Base | Representation |
---|---|
bin | 111110111100011… |
… | …110100111010001 |
3 | 2201121010110111101 |
4 | 332330132213101 |
5 | 4130321311200 |
6 | 252442344401 |
7 | 35112126655 |
oct | 7674364721 |
9 | 2647113441 |
10 | 1056041425 |
11 | 4a212060a |
12 | 2557bb101 |
13 | 13aa2c3aa |
14 | a0378a65 |
15 | 62aa126a |
hex | 3ef1e9d1 |
1056041425 has 12 divisors (see below), whose sum is σ = 1322994316. Its totient is φ = 836121600.
The previous prime is 1056041419. The next prime is 1056041447. The reversal of 1056041425 is 5241406501.
It can be written as a sum of positive squares in 6 ways, for example, as 212022721 + 844018704 = 14561^2 + 29052^2 .
It is not a de Polignac number, because 1056041425 - 23 = 1056041417 is a prime.
It is a super-2 number, since 2×10560414252 = 2230446982632061250, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1056041393 and 1056041402.
It is an unprimeable number.
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 in 11 ways as a sum of consecutive naturals, for example, 215316 + ... + 220165.
Almost surely, 21056041425 is an apocalyptic number.
It is an amenable number.
1056041425 is a deficient number, since it is larger than the sum of its proper divisors (266952891).
1056041425 is an equidigital number, since it uses as much as digits as its factorization.
1056041425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 435588 (or 435583 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
The square root of 1056041425 is about 32496.7909954198. The cubic root of 1056041425 is about 1018.3419894981.
Adding to 1056041425 its reverse (5241406501), we get a palindrome (6297447926).
The spelling of 1056041425 in words is "one billion, fifty-six million, forty-one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •