Base | Representation |
---|---|
bin | 101110101110011111… |
… | …1100110101011110000 |
3 | 100121000011201221210121 |
4 | 1131130333212223300 |
5 | 3121001133101300 |
6 | 114033025140024 |
7 | 10151425353415 |
oct | 1353477465360 |
9 | 317004657717 |
10 | 100344425200 |
11 | 396128a2928 |
12 | 1754518a614 |
13 | 9601c93336 |
14 | 4bdcaba10c |
15 | 29245c181a |
hex | 175cfe6af0 |
100344425200 has 60 divisors (see below), whose sum is σ = 241164495288. Its totient is φ = 40123283200.
The previous prime is 100344425179. The next prime is 100344425221. The reversal of 100344425200 is 2524443001.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (100344425179) and next prime (100344425221).
It is a Harshad number since it is a multiple of its sum of digits (25).
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 11 ways as a sum of consecutive naturals, for example, 1100559 + ... + 1188241.
Almost surely, 2100344425200 is an apocalyptic number.
100344425200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100344425200 is an abundant number, since it is smaller than the sum of its proper divisors (140820070088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100344425200 is a wasteful number, since it uses less digits than its factorization.
100344425200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90562 (or 90551 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 25.
Adding to 100344425200 its reverse (2524443001), we get a palindrome (102868868201).
The spelling of 100344425200 in words is "one hundred billion, three hundred forty-four million, four hundred twenty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •