Base | Representation |
---|---|
bin | 10010101001010110… |
… | …10000101001001100 |
3 | 221211122122012020020 |
4 | 21110223100221030 |
5 | 131000200423400 |
6 | 4333201022140 |
7 | 503033236221 |
oct | 112453205114 |
9 | 27748565206 |
10 | 10010561100 |
11 | 42777787a1 |
12 | 1b34624950 |
13 | c36c47547 |
14 | 6ad711948 |
15 | 3d8c972a0 |
hex | 254ad0a4c |
10010561100 has 72 divisors (see below), whose sum is σ = 29009632848. Its totient is φ = 2665267200.
The previous prime is 10010561089. The next prime is 10010561123. The reversal of 10010561100 is 116501001.
It is a super-2 number, since 2×100105611002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 10010561100.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 166272 + ... + 218328.
Almost surely, 210010561100 is an apocalyptic number.
10010561100 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 10010561100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14504816424).
10010561100 is an abundant number, since it is smaller than the sum of its proper divisors (18999071748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010561100 is a wasteful number, since it uses less digits than its factorization.
10010561100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52715 (or 52708 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 15.
The spelling of 10010561100 in words is "ten billion, ten million, five hundred sixty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •