Base | Representation |
---|---|
bin | 10010110101010010… |
… | …00101110001110000 |
3 | 222002121222112001221 |
4 | 21122221011301300 |
5 | 131201311434400 |
6 | 4351134234424 |
7 | 505360104013 |
oct | 113251056160 |
9 | 28077875057 |
10 | 10110655600 |
11 | 4319224221 |
12 | 1b62055a14 |
13 | c518c2066 |
14 | 6bcb2937a |
15 | 3e2969c1a |
hex | 25aa45c70 |
10110655600 has 120 divisors (see below), whose sum is σ = 24715659168. Its totient is φ = 3973939200.
The previous prime is 10110655579. The next prime is 10110655609. The reversal of 10110655600 is 655601101.
It is a super-2 number, since 2×101106556002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110655609) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 16386492 + ... + 16387108.
Almost surely, 210110655600 is an apocalyptic number.
10110655600 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10110655600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12357829584).
10110655600 is an abundant number, since it is smaller than the sum of its proper divisors (14605003568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110655600 is a wasteful number, since it uses less digits than its factorization.
10110655600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1283 (or 1272 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 25.
The spelling of 10110655600 in words is "ten billion, one hundred ten million, six hundred fifty-five thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •