Base | Representation |
---|---|
bin | 110011001010111011… |
… | …0011110000100010001 |
3 | 101111122022011022211210 |
4 | 1212111312132010101 |
5 | 3300022344012023 |
6 | 122252034530333 |
7 | 10640063565564 |
oct | 1462566360421 |
9 | 344568138753 |
10 | 109888266513 |
11 | 42670075093 |
12 | 193694369a9 |
13 | a49330880c |
14 | 546641a4db |
15 | 2cd23c6593 |
hex | 1995d9e111 |
109888266513 has 32 divisors (see below), whose sum is σ = 151162577280. Its totient is φ = 70955205120.
The previous prime is 109888266493. The next prime is 109888266529. The reversal of 109888266513 is 315662888901.
It is not a de Polignac number, because 109888266513 - 29 = 109888266001 is a prime.
It is a super-2 number, since 2×1098882665132 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (109888266113) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 24652981 + ... + 24657437.
It is an arithmetic number, because the mean of its divisors is an integer number (4723830540).
Almost surely, 2109888266513 is an apocalyptic number.
It is an amenable number.
109888266513 is a deficient number, since it is larger than the sum of its proper divisors (41274310767).
109888266513 is a wasteful number, since it uses less digits than its factorization.
109888266513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5457.
The product of its (nonzero) digits is 4976640, while the sum is 57.
The spelling of 109888266513 in words is "one hundred nine billion, eight hundred eighty-eight million, two hundred sixty-six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •