Base | Representation |
---|---|
bin | 110011000011000111… |
… | …1100011011111010000 |
3 | 101110222001102110221021 |
4 | 1212012033203133100 |
5 | 3244003330004424 |
6 | 122210042205224 |
7 | 10630434040432 |
oct | 1460617433720 |
9 | 343861373837 |
10 | 109626406864 |
11 | 42546281057 |
12 | 192b57b3814 |
13 | a450ca2c90 |
14 | 543d734652 |
15 | 2cb93ed4e4 |
hex | 19863e37d0 |
109626406864 has 20 divisors (see below), whose sum is σ = 228739714756. Its totient is φ = 50596803072.
The previous prime is 109626406861. The next prime is 109626406927. The reversal of 109626406864 is 468604626901.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 16718490000 + 92907916864 = 129300^2 + 304808^2 .
It is a super-2 number, since 2×1096264068642 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109626406861) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 263524809 + ... + 263525224.
Almost surely, 2109626406864 is an apocalyptic number.
It is an amenable number.
109626406864 is an abundant number, since it is smaller than the sum of its proper divisors (119113307892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109626406864 is a wasteful number, since it uses less digits than its factorization.
109626406864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 527050054 (or 527050048 counting only the distinct ones).
The product of its (nonzero) digits is 2985984, while the sum is 52.
The spelling of 109626406864 in words is "one hundred nine billion, six hundred twenty-six million, four hundred six thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •