Base | Representation |
---|---|
bin | 11000100000010101… |
… | …01101110101100111 |
3 | 1020221212121111020111 |
4 | 30100022231311213 |
5 | 203420433142120 |
6 | 10013245513451 |
7 | 644010254230 |
oct | 142012556547 |
9 | 36855544214 |
10 | 13156146535 |
11 | 5641335684 |
12 | 2671b72887 |
13 | 13188434bc |
14 | 8cb3b4087 |
15 | 51eee775a |
hex | 3102add67 |
13156146535 has 32 divisors (see below), whose sum is σ = 19142000640. Its totient is φ = 8479199232.
The previous prime is 13156146491. The next prime is 13156146547. The reversal of 13156146535 is 53564165131.
13156146535 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 13156146535 - 219 = 13155622247 is a prime.
It is a congruent number.
It is an unprimeable number.
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, 6567 + ... + 162343.
It is an arithmetic number, because the mean of its divisors is an integer number (598187520).
Almost surely, 213156146535 is an apocalyptic number.
13156146535 is a deficient number, since it is larger than the sum of its proper divisors (5985854105).
13156146535 is a wasteful number, since it uses less digits than its factorization.
13156146535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155935.
The product of its digits is 162000, while the sum is 40.
The spelling of 13156146535 in words is "thirteen billion, one hundred fifty-six million, one hundred forty-six thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •