Base | Representation |
---|---|
bin | 1101000000101… |
… | …01010110011000 |
3 | 21121100212001020 |
4 | 12200111112120 |
5 | 210414424402 |
6 | 14455122440 |
7 | 2463445350 |
oct | 640252630 |
9 | 247325036 |
10 | 109139352 |
11 | 56674013 |
12 | 30673420 |
13 | 197c36ca |
14 | 106cdb60 |
15 | 98ac8bc |
hex | 6815598 |
109139352 has 32 divisors (see below), whose sum is σ = 311827200. Its totient is φ = 31182624.
The previous prime is 109139341. The next prime is 109139353. The reversal of 109139352 is 253931901.
It is a super-4 number, since 4×1091393524 (a number of 33 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109139353) 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, 324652 + ... + 324987.
It is an arithmetic number, because the mean of its divisors is an integer number (9744600).
Almost surely, 2109139352 is an apocalyptic number.
109139352 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
109139352 is an abundant number, since it is smaller than the sum of its proper divisors (202687848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109139352 is a wasteful number, since it uses less digits than its factorization.
109139352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 649655 (or 649651 counting only the distinct ones).
The product of its (nonzero) digits is 7290, while the sum is 33.
The square root of 109139352 is about 10446.9781276693. The cubic root of 109139352 is about 477.8890985283.
The spelling of 109139352 in words is "one hundred nine million, one hundred thirty-nine thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •