Base | Representation |
---|---|
bin | 111110111100010… |
… | …100100000111101 |
3 | 2201121001100202101 |
4 | 332330110200331 |
5 | 4130314000221 |
6 | 252441425101 |
7 | 35111565244 |
oct | 7674244075 |
9 | 2647040671 |
10 | 1056000061 |
11 | 4a20a2526 |
12 | 25579b191 |
13 | 13aa1660c |
14 | a036795b |
15 | 62a93d91 |
hex | 3ef1483d |
1056000061 has 2 divisors, whose sum is σ = 1056000062. Its totient is φ = 1056000060.
The previous prime is 1056000007. The next prime is 1056000137. The reversal of 1056000061 is 1600006501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1017992836 + 38007225 = 31906^2 + 6165^2 .
It is a cyclic number.
It is not a de Polignac number, because 1056000061 - 225 = 1022445629 is a prime.
It is a super-2 number, since 2×10560000612 = 2230272257664007442, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1056001061) 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, 528000030 + 528000031.
It is an arithmetic number, because the mean of its divisors is an integer number (528000031).
Almost surely, 21056000061 is an apocalyptic number.
It is an amenable number.
1056000061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1056000061 is an equidigital number, since it uses as much as digits as its factorization.
1056000061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 1056000061 is about 32496.1545571164. The cubic root of 1056000061 is about 1018.3286935399.
Adding to 1056000061 its reverse (1600006501), we get a palindrome (2656006562).
The spelling of 1056000061 in words is "one billion, fifty-six million, sixty-one", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •