Base | Representation |
---|---|
bin | 110011011101010100… |
… | …1000001110110011100 |
3 | 101120020022121001002112 |
4 | 1212322221001312130 |
5 | 3302303402000220 |
6 | 122433204213152 |
7 | 10661300152364 |
oct | 1467251016634 |
9 | 346208531075 |
10 | 110505500060 |
11 | 4295752385a |
12 | 1950009a1b8 |
13 | a561159577 |
14 | 54c43ab9a4 |
15 | 2d1b69a5c5 |
hex | 19baa41d9c |
110505500060 has 12 divisors (see below), whose sum is σ = 232061550168. Its totient is φ = 44202200016.
The previous prime is 110505499943. The next prime is 110505500087. The reversal of 110505500060 is 60005505011.
It is a super-2 number, since 2×1105055000602 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110505499999 and 110505500035.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2762637482 + ... + 2762637521.
It is an arithmetic number, because the mean of its divisors is an integer number (19338462514).
Almost surely, 2110505500060 is an apocalyptic number.
110505500060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110505500060 is an abundant number, since it is smaller than the sum of its proper divisors (121556050108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110505500060 is a wasteful number, since it uses less digits than its factorization.
110505500060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5525275012 (or 5525275010 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 23.
The spelling of 110505500060 in words is "one hundred ten billion, five hundred five million, five hundred thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •