Base | Representation |
---|---|
bin | 101110111100101110… |
… | …0101110011110110100 |
3 | 100122020110001012020000 |
4 | 1131321130232132310 |
5 | 3122440341240424 |
6 | 114152241311300 |
7 | 10166313225105 |
oct | 1357134563664 |
9 | 318213035200 |
10 | 100821821364 |
11 | 39838320710 |
12 | 17659035530 |
13 | 9679b62a84 |
14 | 4c4626a3ac |
15 | 29514723c9 |
hex | 177972e7b4 |
100821821364 has 120 divisors (see below), whose sum is σ = 287676814656. Its totient is φ = 30536352000.
The previous prime is 100821821329. The next prime is 100821821383. The reversal of 100821821364 is 463128128001.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 8230284 + ... + 8242524.
Almost surely, 2100821821364 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 100821821364, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143838407328).
100821821364 is an abundant number, since it is smaller than the sum of its proper divisors (186854993292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100821821364 is a wasteful number, since it uses less digits than its factorization.
100821821364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14579 (or 14568 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 36.
Adding to 100821821364 its reverse (463128128001), we get a palindrome (563949949365).
The spelling of 100821821364 in words is "one hundred billion, eight hundred twenty-one million, eight hundred twenty-one thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •