Base | Representation |
---|---|
bin | 111110111100100… |
… | …011011011000001 |
3 | 2201121011110111212 |
4 | 332330203123001 |
5 | 4130322423441 |
6 | 252443015505 |
7 | 35112241253 |
oct | 7674433301 |
9 | 2647143455 |
10 | 1056061121 |
11 | 4a2134395 |
12 | 25580a595 |
13 | 13aa3834b |
14 | a0381cd3 |
15 | 62aa6eeb |
hex | 3ef236c1 |
1056061121 has 2 divisors, whose sum is σ = 1056061122. Its totient is φ = 1056061120.
The previous prime is 1056061117. The next prime is 1056061229. The reversal of 1056061121 is 1211606501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 915970225 + 140090896 = 30265^2 + 11836^2 .
It is a cyclic number.
It is not a de Polignac number, because 1056061121 - 22 = 1056061117 is a prime.
It is a super-3 number, since 3×10560611213 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (1056061421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 528030560 + 528030561.
It is an arithmetic number, because the mean of its divisors is an integer number (528030561).
Almost surely, 21056061121 is an apocalyptic number.
It is an amenable number.
1056061121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1056061121 is an equidigital number, since it uses as much as digits as its factorization.
1056061121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 23.
The square root of 1056061121 is about 32497.0940393137. The cubic root of 1056061121 is about 1018.3483204174.
Adding to 1056061121 its reverse (1211606501), we get a palindrome (2267667622).
The spelling of 1056061121 in words is "one billion, fifty-six million, sixty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •