Base | Representation |
---|---|
bin | 11110000110100010… |
… | …11000100101010111 |
3 | 1112201021210200102202 |
4 | 33003101120211113 |
5 | 231044210004101 |
6 | 11231350355115 |
7 | 1111325241110 |
oct | 170321304527 |
9 | 45637720382 |
10 | 16161016151 |
11 | 69435216a5 |
12 | 317035ba9b |
13 | 16a7241367 |
14 | ad44c7207 |
15 | 648bee36b |
hex | 3c3458957 |
16161016151 has 16 divisors (see below), whose sum is σ = 19419858240. Its totient is φ = 13155367680.
The previous prime is 16161016121. The next prime is 16161016243. The reversal of 16161016151 is 15161016161.
It is a happy number.
16161016151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-16161016151 is a prime.
It is a super-2 number, since 2×161610161512 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16161016121) 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, 640166 + ... + 664931.
It is an arithmetic number, because the mean of its divisors is an integer number (1213741140).
Almost surely, 216161016151 is an apocalyptic number.
16161016151 is a deficient number, since it is larger than the sum of its proper divisors (3258842089).
16161016151 is a wasteful number, since it uses less digits than its factorization.
16161016151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1305194.
The product of its (nonzero) digits is 1080, while the sum is 29.
The spelling of 16161016151 in words is "sixteen billion, one hundred sixty-one million, sixteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •