Base | Representation |
---|---|
bin | 101110101011000111… |
… | …0111111111100001100 |
3 | 100120201021100101112010 |
4 | 1131112032333330030 |
5 | 3120233120122200 |
6 | 114013454341220 |
7 | 10145550421035 |
oct | 1352616777414 |
9 | 316637311463 |
10 | 100231020300 |
11 | 39564886074 |
12 | 175131ba810 |
13 | 95b4638248 |
14 | 4bcb9d9a8c |
15 | 2919670150 |
hex | 17563bff0c |
100231020300 has 72 divisors (see below), whose sum is σ = 296172043776. Its totient is φ = 26159581760.
The previous prime is 100231020277. The next prime is 100231020301. The reversal of 100231020300 is 3020132001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (100231020301) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 3540192 + ... + 3568391.
It is an arithmetic number, because the mean of its divisors is an integer number (4113500608).
Almost surely, 2100231020300 is an apocalyptic number.
100231020300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100231020300 is an abundant number, since it is smaller than the sum of its proper divisors (195941023476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100231020300 is a wasteful number, since it uses less digits than its factorization.
100231020300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7108647 (or 7108640 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 100231020300 its reverse (3020132001), we get a palindrome (103251152301).
The spelling of 100231020300 in words is "one hundred billion, two hundred thirty-one million, twenty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •