Base | Representation |
---|---|
bin | 10100001000111110… |
… | …10000110110110101 |
3 | 1000220120001012221220 |
4 | 22010133100312311 |
5 | 134121024110423 |
6 | 4544534100553 |
7 | 531643424430 |
oct | 120437206665 |
9 | 30816035856 |
10 | 10812722613 |
11 | 46495555a0 |
12 | 21191aa759 |
13 | 10341a6224 |
14 | 748080817 |
15 | 4343e99e3 |
hex | 2847d0db5 |
10812722613 has 32 divisors (see below), whose sum is σ = 17984581632. Its totient is φ = 5613816000.
The previous prime is 10812722539. The next prime is 10812722659. The reversal of 10812722613 is 31622721801.
10812722613 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10812722613 - 210 = 10812721589 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10812722693) 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 31 ways as a sum of consecutive naturals, for example, 426820 + ... + 451442.
It is an arithmetic number, because the mean of its divisors is an integer number (562018176).
Almost surely, 210812722613 is an apocalyptic number.
It is an amenable number.
10812722613 is a deficient number, since it is larger than the sum of its proper divisors (7171859019).
10812722613 is a wasteful number, since it uses less digits than its factorization.
10812722613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26545.
The product of its (nonzero) digits is 8064, while the sum is 33.
It can be divided in two parts, 108 and 12722613, that added together give a palindrome (12722721).
The spelling of 10812722613 in words is "ten billion, eight hundred twelve million, seven hundred twenty-two thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •