Base | Representation |
---|---|
bin | 10010111010101101… |
… | …01100110101101001 |
3 | 222012210121201022000 |
4 | 21131112230311221 |
5 | 131244434312010 |
6 | 4355441521213 |
7 | 506451663612 |
oct | 113526546551 |
9 | 28183551260 |
10 | 10156166505 |
11 | 4341989241 |
12 | 1b75343209 |
13 | c5b1680a4 |
14 | 6c4bb4c09 |
15 | 3e69597c0 |
hex | 25d5acd69 |
10156166505 has 32 divisors (see below), whose sum is σ = 18197606400. Its totient is φ = 5373962496.
The previous prime is 10156166453. The next prime is 10156166509. The reversal of 10156166505 is 50566165101.
It is not a de Polignac number, because 10156166505 - 211 = 10156164457 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10156166505.
It is not an unprimeable number, because it can be changed into a prime (10156166509) 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 31 ways as a sum of consecutive naturals, for example, 279040 + ... + 313329.
It is an arithmetic number, because the mean of its divisors is an integer number (568675200).
Almost surely, 210156166505 is an apocalyptic number.
10156166505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10156166505 is a deficient number, since it is larger than the sum of its proper divisors (8041439895).
10156166505 is a wasteful number, since it uses less digits than its factorization.
10156166505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 592510 (or 592504 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 36.
It can be divided in two parts, 1015616 and 6505, that added together give a square (1022121 = 10112).
The spelling of 10156166505 in words is "ten billion, one hundred fifty-six million, one hundred sixty-six thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •