Base | Representation |
---|---|
bin | 110010110100100111… |
… | …0111101101001011000 |
3 | 101102201010121211220210 |
4 | 1211221032331221120 |
5 | 3242004231300400 |
6 | 122045454451120 |
7 | 10612404151632 |
oct | 1455116755130 |
9 | 342633554823 |
10 | 109139712600 |
11 | 42316582496 |
12 | 1919a803aa0 |
13 | a3a41c92c9 |
14 | 53d4c43a52 |
15 | 2c8b812950 |
hex | 19693bda58 |
109139712600 has 192 divisors, whose sum is σ = 356714668800. Its totient is φ = 27527662080.
The previous prime is 109139712553. The next prime is 109139712623. The reversal of 109139712600 is 6217931901.
It is a happy number.
It is a super-2 number, since 2×1091397126002 (a number of 23 digits) contains 22 as substring.
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, 7368402 + ... + 7383198.
It is an arithmetic number, because the mean of its divisors is an integer number (1857888900).
Almost surely, 2109139712600 is an apocalyptic number.
109139712600 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 109139712600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (178357334400).
109139712600 is an abundant number, since it is smaller than the sum of its proper divisors (247574956200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109139712600 is a wasteful number, since it uses less digits than its factorization.
109139712600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15482 (or 15473 counting only the distinct ones).
The product of its (nonzero) digits is 20412, while the sum is 39.
The spelling of 109139712600 in words is "one hundred nine billion, one hundred thirty-nine million, seven hundred twelve thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •