Base | Representation |
---|---|
bin | 111111001101011… |
… | …111001000100001 |
3 | 2201220111222111211 |
4 | 333031133020201 |
5 | 4132442000001 |
6 | 253122110121 |
7 | 35165046511 |
oct | 7715371041 |
9 | 2656458454 |
10 | 1060500001 |
11 | 4a4696390 |
12 | 2571ab341 |
13 | 13b9308c2 |
14 | a0bb9841 |
15 | 63182351 |
hex | 3f35f221 |
1060500001 has 16 divisors (see below), whose sum is σ = 1228452480. Its totient is φ = 904794880.
The previous prime is 1060499977. The next prime is 1060500011. The reversal of 1060500001 is 1000050601.
It is not a de Polignac number, because 1060500001 - 27 = 1060499873 is a prime.
It is a super-2 number, since 2×10605000012 = 2249320504242000002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1060500011) 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 in 15 ways as a sum of consecutive naturals, for example, 59235 + ... + 75031.
It is an arithmetic number, because the mean of its divisors is an integer number (76778280).
Almost surely, 21060500001 is an apocalyptic number.
1060500001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1060500001 is a deficient number, since it is larger than the sum of its proper divisors (167952479).
1060500001 is a wasteful number, since it uses less digits than its factorization.
1060500001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16184.
The product of its (nonzero) digits is 30, while the sum is 13.
The square root of 1060500001 is about 32565.3189912213. The cubic root of 1060500001 is about 1019.7731140239.
Adding to 1060500001 its reverse (1000050601), we get a palindrome (2060550602).
The spelling of 1060500001 in words is "one billion, sixty million, five hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •