Base | Representation |
---|---|
bin | 111111001011110… |
… | …010101111000101 |
3 | 2201212200102110112 |
4 | 333023302233011 |
5 | 4132333243010 |
6 | 253104402405 |
7 | 35161220201 |
oct | 7713625705 |
9 | 2655612415 |
10 | 1060056005 |
11 | 4a4412848 |
12 | 257016405 |
13 | 13b806798 |
14 | a0b01b01 |
15 | 630e5a05 |
hex | 3f2f2bc5 |
1060056005 has 8 divisors (see below), whose sum is σ = 1313101824. Its totient is φ = 820688400.
The previous prime is 1060055981. The next prime is 1060056007. The reversal of 1060056005 is 5006500601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1060056005 - 28 = 1060055749 is a prime.
It is a super-2 number, since 2×10600560052 = 2247437467473120050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1060056007) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 3419381 + ... + 3419690.
It is an arithmetic number, because the mean of its divisors is an integer number (164137728).
Almost surely, 21060056005 is an apocalyptic number.
It is an amenable number.
1060056005 is a deficient number, since it is larger than the sum of its proper divisors (253045819).
1060056005 is an equidigital number, since it uses as much as digits as its factorization.
1060056005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6839107.
The product of its (nonzero) digits is 900, while the sum is 23.
The square root of 1060056005 is about 32558.5012707895. The cubic root of 1060056005 is about 1019.6307791551.
Adding to 1060056005 its reverse (5006500601), we get a palindrome (6066556606).
The spelling of 1060056005 in words is "one billion, sixty million, fifty-six thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •