Base | Representation |
---|---|
bin | 110010110011101101… |
… | …0010000110000001101 |
3 | 101102122000001120210000 |
4 | 1211213122100300031 |
5 | 3241423413320023 |
6 | 122042443034513 |
7 | 10611553134465 |
oct | 1454732206015 |
9 | 342560046700 |
10 | 109109120013 |
11 | 42300287863 |
12 | 1919050ba39 |
13 | a39aa7769a |
14 | 53d0b5cba5 |
15 | 2c88cbd243 |
hex | 1967690c0d |
109109120013 has 40 divisors (see below), whose sum is σ = 165095884800. Its totient is φ = 71801188992.
The previous prime is 109109120011. The next prime is 109109120059. The reversal of 109109120013 is 310021901901.
It is not a de Polignac number, because 109109120013 - 21 = 109109120011 is a prime.
It is a super-2 number, since 2×1091091200132 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109109120011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 8592373 + ... + 8605061.
It is an arithmetic number, because the mean of its divisors is an integer number (4127397120).
Almost surely, 2109109120013 is an apocalyptic number.
It is an amenable number.
109109120013 is a deficient number, since it is larger than the sum of its proper divisors (55986764787).
109109120013 is a wasteful number, since it uses less digits than its factorization.
109109120013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14063 (or 14054 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 27.
The spelling of 109109120013 in words is "one hundred nine billion, one hundred nine million, one hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •