Base | Representation |
---|---|
bin | 1101000110110… |
… | …01101110001110 |
3 | 21122212201101200 |
4 | 12203121232032 |
5 | 211121144234 |
6 | 14524250330 |
7 | 2503335360 |
oct | 643315616 |
9 | 248781350 |
10 | 109943694 |
11 | 57073363 |
12 | 309a09a6 |
13 | 19a15853 |
14 | 1085cd30 |
15 | 99bad99 |
hex | 68d9b8e |
109943694 has 48 divisors (see below), whose sum is σ = 275993952. Its totient is φ = 30979584.
The previous prime is 109943681. The next prime is 109943707. The reversal of 109943694 is 496349901.
It is an interprime number because it is at equal distance from previous prime (109943681) and next prime (109943707).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3222 + ... + 15174.
It is an arithmetic number, because the mean of its divisors is an integer number (5749874).
Almost surely, 2109943694 is an apocalyptic number.
109943694 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 109943694, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (137996976).
109943694 is an abundant number, since it is smaller than the sum of its proper divisors (166050258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109943694 is a wasteful number, since it uses less digits than its factorization.
109943694 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12041 (or 12038 counting only the distinct ones).
The product of its (nonzero) digits is 209952, while the sum is 45.
The square root of 109943694 is about 10485.4038548832. The cubic root of 109943694 is about 479.0602185149.
The spelling of 109943694 in words is "one hundred nine million, nine hundred forty-three thousand, six hundred ninety-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •