Base | Representation |
---|---|
bin | 110011001011111011… |
… | …0010101011010011100 |
3 | 101111201122020021020202 |
4 | 1212113312111122130 |
5 | 3300104434114000 |
6 | 122255233203032 |
7 | 10640651521562 |
oct | 1462766253234 |
9 | 344648207222 |
10 | 109921785500 |
11 | 42687a8942a |
12 | 19378700478 |
13 | a49a243437 |
14 | 546aa63a32 |
15 | 2cd52e7dd5 |
hex | 1997d9569c |
109921785500 has 24 divisors (see below), whose sum is σ = 240069180624. Its totient is φ = 43968714000.
The previous prime is 109921785487. The next prime is 109921785517. The reversal of 109921785500 is 5587129901.
It is a happy number.
109921785500 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a hoax number, since the sum of its digits (47) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 109921286 + ... + 109922285.
It is an arithmetic number, because the mean of its divisors is an integer number (10002882526).
Almost surely, 2109921785500 is an apocalyptic number.
109921785500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
109921785500 is an abundant number, since it is smaller than the sum of its proper divisors (130147395124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109921785500 is a wasteful number, since it uses less digits than its factorization.
109921785500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219843590 (or 219843578 counting only the distinct ones).
The product of its (nonzero) digits is 226800, while the sum is 47.
The spelling of 109921785500 in words is "one hundred nine billion, nine hundred twenty-one million, seven hundred eighty-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •