Base | Representation |
---|---|
bin | 11110110110100101111… |
… | …00100110010001001000 |
3 | 10202100022021011101101210 |
4 | 33123102330212101020 |
5 | 114332041332234220 |
6 | 2131000444413120 |
7 | 136406202203241 |
oct | 17332274462110 |
9 | 3670267141353 |
10 | 1060101055560 |
11 | 37964a455548 |
12 | 1515558471a0 |
13 | 78c75948b01 |
14 | 394484c3cc8 |
15 | 1c897ccb6e0 |
hex | f6d2f26448 |
1060101055560 has 128 divisors (see below), whose sum is σ = 3342217380480. Its totient is φ = 268656611328.
The previous prime is 1060101055553. The next prime is 1060101055583. The reversal of 1060101055560 is 655501010601.
1060101055560 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10601010555602 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2585377 + ... + 2967216.
It is an arithmetic number, because the mean of its divisors is an integer number (26111073285).
Almost surely, 21060101055560 is an apocalyptic number.
1060101055560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1060101055560 is an abundant number, since it is smaller than the sum of its proper divisors (2282116324920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1060101055560 is a wasteful number, since it uses less digits than its factorization.
1060101055560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5552687 (or 5552683 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 30.
The spelling of 1060101055560 in words is "one trillion, sixty billion, one hundred one million, fifty-five thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •