Base | Representation |
---|---|
bin | 110010111100010100… |
… | …0001111010100010100 |
3 | 101110101010122001021000 |
4 | 1211320220033110110 |
5 | 3243021341344240 |
6 | 122131242423300 |
7 | 10621661426100 |
oct | 1457050172424 |
9 | 343333561230 |
10 | 109397996820 |
11 | 42439354222 |
12 | 19251201b30 |
13 | a41587c5c8 |
14 | 541b278900 |
15 | 2ca4331430 |
hex | 1978a0f514 |
109397996820 has 144 divisors (see below), whose sum is σ = 395916655680. Its totient is φ = 25005250368.
The previous prime is 109397996803. The next prime is 109397996839. The reversal of 109397996820 is 28699793901.
It is a happy number.
It is a super-2 number, since 2×1093979968202 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2040774 + ... + 2093693.
It is an arithmetic number, because the mean of its divisors is an integer number (2749421220).
Almost surely, 2109397996820 is an apocalyptic number.
109397996820 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
109397996820 is an abundant number, since it is smaller than the sum of its proper divisors (286518658860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109397996820 is a wasteful number, since it uses less digits than its factorization.
109397996820 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4134499 (or 4134484 counting only the distinct ones).
The product of its (nonzero) digits is 13226976, while the sum is 63.
The spelling of 109397996820 in words is "one hundred nine billion, three hundred ninety-seven million, nine hundred ninety-six thousand, eight hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •