Base | Representation |
---|---|
bin | 111110111100100… |
… | …001100101101011 |
3 | 2201121011002012201 |
4 | 332330201211223 |
5 | 4130322203421 |
6 | 252442521031 |
7 | 35112210334 |
oct | 7674414553 |
9 | 2647132181 |
10 | 1056053611 |
11 | 4a2129788 |
12 | 255806177 |
13 | 13aa34ac2 |
14 | a037d28b |
15 | 62aa4b91 |
hex | 3ef2196b |
1056053611 has 8 divisors (see below), whose sum is σ = 1112785920. Its totient is φ = 999436392.
The previous prime is 1056053599. The next prime is 1056053623. The reversal of 1056053611 is 1163506501.
It is an interprime number because it is at equal distance from previous prime (1056053599) and next prime (1056053623).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1056053611 is a prime.
It is a super-2 number, since 2×10560536112 = 2230498458612278642, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1056053611.
It is not an unprimeable number, because it can be changed into a prime (1056053711) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9595 + ... + 46948.
It is an arithmetic number, because the mean of its divisors is an integer number (139098240).
Almost surely, 21056053611 is an apocalyptic number.
1056053611 is a deficient number, since it is larger than the sum of its proper divisors (56732309).
1056053611 is an equidigital number, since it uses as much as digits as its factorization.
1056053611 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57545.
The product of its (nonzero) digits is 2700, while the sum is 28.
The square root of 1056053611 is about 32496.9784903151. The cubic root of 1056053611 is about 1018.3459064744.
The spelling of 1056053611 in words is "one billion, fifty-six million, fifty-three thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •