Base | Representation |
---|---|
bin | 1101000011100… |
… | …00010101001100 |
3 | 21122001210020110 |
4 | 12201300111030 |
5 | 211013341022 |
6 | 14511120020 |
7 | 2466560001 |
oct | 641602514 |
9 | 248053213 |
10 | 109512012 |
11 | 568a8aa5 |
12 | 30813010 |
13 | 198c420c |
14 | 107898a8 |
15 | 993300c |
hex | 687054c |
109512012 has 48 divisors (see below), whose sum is σ = 260288000. Its totient is φ = 35830080.
The previous prime is 109511999. The next prime is 109512017. The reversal of 109512012 is 210215901.
It is a self number, because there is not a number n which added to its sum of digits gives 109512012.
It is not an unprimeable number, because it can be changed into a prime (109512017) 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 15 ways as a sum of consecutive naturals, for example, 313614 + ... + 313962.
Almost surely, 2109512012 is an apocalyptic number.
109512012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
109512012 is an abundant number, since it is smaller than the sum of its proper divisors (150775988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109512012 is a wasteful number, since it uses less digits than its factorization.
109512012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 766 (or 764 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 21.
The square root of 109512012 is about 10464.7987080498. The cubic root of 109512012 is about 478.4324034364.
Adding to 109512012 its reverse (210215901), we get a palindrome (319727913).
The spelling of 109512012 in words is "one hundred nine million, five hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •