Base | Representation |
---|---|
bin | 110011001011010011… |
… | …1011011000000000001 |
3 | 101111200012022021201102 |
4 | 1212112213123000001 |
5 | 3300034140132014 |
6 | 122253213544145 |
7 | 10640310633242 |
oct | 1462647330001 |
9 | 344605267642 |
10 | 109901099009 |
11 | 4267733a359 |
12 | 193717a5055 |
13 | a495b7c700 |
14 | 5467ddacc9 |
15 | 2cd35ad8de |
hex | 19969db001 |
109901099009 has 12 divisors (see below), whose sum is σ = 119014758576. Its totient is φ = 101439132912.
The previous prime is 109901098981. The next prime is 109901099017. The reversal of 109901099009 is 900990109901.
It is a de Polignac number, because none of the positive numbers 2k-109901099009 is a prime.
It is a Smith number, since the sum of its digits (47) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (109901099029) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3728162 + ... + 3757524.
It is an arithmetic number, because the mean of its divisors is an integer number (9917896548).
Almost surely, 2109901099009 is an apocalyptic number.
It is an amenable number.
109901099009 is a deficient number, since it is larger than the sum of its proper divisors (9113659567).
109901099009 is a wasteful number, since it uses less digits than its factorization.
109901099009 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51536 (or 51523 counting only the distinct ones).
The product of its (nonzero) digits is 59049, while the sum is 47.
The spelling of 109901099009 in words is "one hundred nine billion, nine hundred one million, ninety-nine thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •