Base | Representation |
---|---|
bin | 10010101010000000… |
… | …01110001101100001 |
3 | 221212000222101001000 |
4 | 21111000032031201 |
5 | 131003102244121 |
6 | 4333514502213 |
7 | 503131033626 |
oct | 112500161541 |
9 | 27760871030 |
10 | 10016056161 |
11 | 427a891271 |
12 | 1b36434969 |
13 | c3811c767 |
14 | 6b034234d |
15 | 3d94d0526 |
hex | 25500e361 |
10016056161 has 8 divisors (see below), whose sum is σ = 14838601760. Its totient is φ = 6677370756.
The previous prime is 10016056121. The next prime is 10016056181. The reversal of 10016056161 is 16165061001.
It is not a de Polignac number, because 10016056161 - 213 = 10016047969 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 370965043 = 10016056161 / (1 + 0 + 0 + 1 + 6 + 0 + 5 + 6 + 1 + 6 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10016056121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 185482495 + ... + 185482548.
It is an arithmetic number, because the mean of its divisors is an integer number (1854825220).
Almost surely, 210016056161 is an apocalyptic number.
It is an amenable number.
10016056161 is a deficient number, since it is larger than the sum of its proper divisors (4822545599).
10016056161 is an equidigital number, since it uses as much as digits as its factorization.
10016056161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 370965052 (or 370965046 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
The spelling of 10016056161 in words is "ten billion, sixteen million, fifty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •