Base | Representation |
---|---|
bin | 10010111010110011… |
… | …10001101001000011 |
3 | 222012212010200001210 |
4 | 21131121301221003 |
5 | 131300141110421 |
6 | 4355511101203 |
7 | 506461562022 |
oct | 113531615103 |
9 | 28185120053 |
10 | 10156972611 |
11 | 4342389945 |
12 | 1b75671803 |
13 | c5b38ac86 |
14 | 6c4d448b9 |
15 | 3e6a68576 |
hex | 25d671a43 |
10156972611 has 16 divisors (see below), whose sum is σ = 13582689824. Its totient is φ = 6751309824.
The previous prime is 10156972589. The next prime is 10156972619. The reversal of 10156972611 is 11627965101.
10156972611 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 10156972611 - 26 = 10156972547 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10156972611.
It is not an unprimeable number, because it can be changed into a prime (10156972619) 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 15 ways as a sum of consecutive naturals, for example, 2763471 + ... + 2767143.
It is an arithmetic number, because the mean of its divisors is an integer number (848918114).
Almost surely, 210156972611 is an apocalyptic number.
10156972611 is a deficient number, since it is larger than the sum of its proper divisors (3425717213).
10156972611 is a wasteful number, since it uses less digits than its factorization.
10156972611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6150.
The product of its (nonzero) digits is 22680, while the sum is 39.
It can be divided in two parts, 10 and 156972611, that added together give a triangular number (156972621 = T17718).
The spelling of 10156972611 in words is "ten billion, one hundred fifty-six million, nine hundred seventy-two thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.804 sec. • engine limits •