Base | Representation |
---|---|
bin | 11110110111111011100… |
… | …11100011000000100101 |
3 | 10202102011101011210100001 |
4 | 33123331303203000211 |
5 | 114340024421300310 |
6 | 2131200052221301 |
7 | 136433053046122 |
oct | 17337563430045 |
9 | 3672141153301 |
10 | 1060820103205 |
11 | 3799893246a5 |
12 | 15171660a831 |
13 | 7905b8c6ca5 |
14 | 394b5bb9749 |
15 | 1c8daeb293a |
hex | f6fdce3025 |
1060820103205 has 8 divisors (see below), whose sum is σ = 1273309968672. Its totient is φ = 848438852688.
The previous prime is 1060820103193. The next prime is 1060820103241. The reversal of 1060820103205 is 5023010280601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1060820103205 - 215 = 1060820070437 is a prime.
It is a super-2 number, since 2×10608201032052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27132247 + ... + 27171316.
It is an arithmetic number, because the mean of its divisors is an integer number (159163746084).
Almost surely, 21060820103205 is an apocalyptic number.
It is an amenable number.
1060820103205 is a deficient number, since it is larger than the sum of its proper divisors (212489865467).
1060820103205 is an equidigital number, since it uses as much as digits as its factorization.
1060820103205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54307475.
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 1060820103205 its reverse (5023010280601), we get a palindrome (6083830383806).
The spelling of 1060820103205 in words is "one trillion, sixty billion, eight hundred twenty million, one hundred three thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •