Base | Representation |
---|---|
bin | 11110110110011001111… |
… | …01000011010001010100 |
3 | 10202100001020222012021102 |
4 | 33123030331003101110 |
5 | 114331340112323220 |
6 | 2130542453405232 |
7 | 136403541452501 |
oct | 17331475032124 |
9 | 3670036865242 |
10 | 1060000511060 |
11 | 3795a8721a17 |
12 | 151528039818 |
13 | 78c5ab7451a |
14 | 39438dd04a8 |
15 | 1c88e06a775 |
hex | f6ccf43454 |
1060000511060 has 24 divisors (see below), whose sum is σ = 2239657528416. Its totient is φ = 421398974880.
The previous prime is 1060000511047. The next prime is 1060000511071. The reversal of 1060000511060 is 601150000601.
It is a happy number.
It is a super-2 number, since 2×10600005110602 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 162573506 + ... + 162580025.
It is an arithmetic number, because the mean of its divisors is an integer number (93319063684).
Almost surely, 21060000511060 is an apocalyptic number.
1060000511060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1060000511060 is an abundant number, since it is smaller than the sum of its proper divisors (1179657017356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1060000511060 is a wasteful number, since it uses less digits than its factorization.
1060000511060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325153703 (or 325153701 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 20.
Adding to 1060000511060 its reverse (601150000601), we get a palindrome (1661150511661).
The spelling of 1060000511060 in words is "one trillion, sixty billion, five hundred eleven thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •