Base | Representation |
---|---|
bin | 1101000110100… |
… | …00100101011110 |
3 | 21122210211001121 |
4 | 12203100211132 |
5 | 211114000040 |
6 | 14523401154 |
7 | 2503121305 |
oct | 643204536 |
9 | 248724047 |
10 | 109906270 |
11 | 57048231 |
12 | 309831ba |
13 | 19a017c6 |
14 | 1084d43c |
15 | 99aec4a |
hex | 68d095e |
109906270 has 8 divisors (see below), whose sum is σ = 197831304. Its totient is φ = 43962504.
The previous prime is 109906261. The next prime is 109906271. The reversal of 109906270 is 72609901.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109906271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5495304 + ... + 5495323.
It is an arithmetic number, because the mean of its divisors is an integer number (24728913).
Almost surely, 2109906270 is an apocalyptic number.
109906270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
109906270 is a deficient number, since it is larger than the sum of its proper divisors (87925034).
109906270 is a wasteful number, since it uses less digits than its factorization.
109906270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10990634.
The product of its (nonzero) digits is 6804, while the sum is 34.
The square root of 109906270 is about 10483.6191270000. The cubic root of 109906270 is about 479.0058561907.
The spelling of 109906270 in words is "one hundred nine million, nine hundred six thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •