Base | Representation |
---|---|
bin | 1101000110101… |
… | …10100000000101 |
3 | 21122212001022001 |
4 | 12203112200011 |
5 | 211120234001 |
6 | 14524105301 |
7 | 2503252042 |
oct | 643264005 |
9 | 248761261 |
10 | 109930501 |
11 | 5706445a |
12 | 30995231 |
13 | 19a0c845 |
14 | 108581c9 |
15 | 99b7001 |
hex | 68d6805 |
109930501 has 8 divisors (see below), whose sum is σ = 115122240. Its totient is φ = 104773152.
The previous prime is 109930493. The next prime is 109930519. The reversal of 109930501 is 105039901.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 109930501 - 23 = 109930493 is a prime.
It is a super-2 number, since 2×1099305012 = 24169430100222002, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 109930501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109930571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1936 + ... + 14953.
It is an arithmetic number, because the mean of its divisors is an integer number (14390280).
Almost surely, 2109930501 is an apocalyptic number.
It is an amenable number.
109930501 is a deficient number, since it is larger than the sum of its proper divisors (5191739).
109930501 is a wasteful number, since it uses less digits than its factorization.
109930501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17195.
The product of its (nonzero) digits is 1215, while the sum is 28.
The square root of 109930501 is about 10484.7747233787. The cubic root of 109930501 is about 479.0410556930.
The spelling of 109930501 in words is "one hundred nine million, nine hundred thirty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •