Base | Representation |
---|---|
bin | 11101011011001000101… |
… | …01000100100110111100 |
3 | 10120122120100220202222102 |
4 | 32231210111010212330 |
5 | 113031012120410220 |
6 | 2052240334404232 |
7 | 133020351653501 |
oct | 16554425044674 |
9 | 3518510822872 |
10 | 1011000560060 |
11 | 35a843506547 |
12 | 143b32060678 |
13 | 7444c35b08a |
14 | 36d0b4214a8 |
15 | 1b4723b6775 |
hex | eb645449bc |
1011000560060 has 48 divisors (see below), whose sum is σ = 2248572239424. Its totient is φ = 380513307648.
The previous prime is 1011000560051. The next prime is 1011000560071. The reversal of 1011000560060 is 600650001101.
It is a happy number.
1011000560060 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 15 ways as a sum of consecutive naturals, for example, 934697 + ... + 1701663.
It is an arithmetic number, because the mean of its divisors is an integer number (46845254988).
Almost surely, 21011000560060 is an apocalyptic number.
1011000560060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1011000560060 is an abundant number, since it is smaller than the sum of its proper divisors (1237571679364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011000560060 is a wasteful number, since it uses less digits than its factorization.
1011000560060 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 770870 (or 770868 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 20.
Adding to 1011000560060 its reverse (600650001101), we get a palindrome (1611650561161).
The spelling of 1011000560060 in words is "one trillion, eleven billion, five hundred sixty thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •