Base | Representation |
---|---|
bin | 101111100010110100… |
… | …1011001010110011100 |
3 | 100202112112120010021000 |
4 | 1133011221121112130 |
5 | 3133100123223400 |
6 | 114523145510300 |
7 | 10243065321636 |
oct | 1370551312634 |
9 | 322475503230 |
10 | 102100211100 |
11 | 3a3339a8858 |
12 | 179551a2390 |
13 | 98219726c4 |
14 | 4d27d63a56 |
15 | 29c87e4600 |
hex | 17c5a5959c |
102100211100 has 144 divisors (see below), whose sum is σ = 328395370240. Its totient is φ = 27213278400.
The previous prime is 102100211093. The next prime is 102100211111. The reversal of 102100211100 is 1112001201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6231519 + ... + 6247881.
Almost surely, 2102100211100 is an apocalyptic number.
102100211100 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 102100211100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (164197685120).
102100211100 is an abundant number, since it is smaller than the sum of its proper divisors (226295159140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102100211100 is a wasteful number, since it uses less digits than its factorization.
102100211100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18697 (or 18684 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 102100211100 its reverse (1112001201), we get a palindrome (103212212301).
The spelling of 102100211100 in words is "one hundred two billion, one hundred million, two hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •