Base | Representation |
---|---|
bin | 10010110100000000… |
… | …11100110100110100 |
3 | 222001212221021012212 |
4 | 21122000130310310 |
5 | 131141100031400 |
6 | 4350114032552 |
7 | 505200413156 |
oct | 113200346464 |
9 | 28055837185 |
10 | 10100002100 |
11 | 4313208081 |
12 | 1b5a578758 |
13 | c4c631c06 |
14 | 6bb554ad6 |
15 | 3e1a63335 |
hex | 25a01cd34 |
10100002100 has 72 divisors (see below), whose sum is σ = 22282740480. Its totient is φ = 3972798720.
The previous prime is 10100002093. The next prime is 10100002103. The reversal of 10100002100 is 120000101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (5).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100002103) 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, 5741021 + ... + 5742779.
Almost surely, 210100002100 is an apocalyptic number.
10100002100 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 10100002100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11141370240).
10100002100 is an abundant number, since it is smaller than the sum of its proper divisors (12182738380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100002100 is a wasteful number, since it uses less digits than its factorization.
10100002100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2697 (or 2690 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 5.
Adding to 10100002100 its reverse (120000101), we get a palindrome (10220002201).
The spelling of 10100002100 in words is "ten billion, one hundred million, two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •