Base | Representation |
---|---|
bin | 1110101100101110010100… |
… | …1001110010100000000001 |
3 | 2010020000200112011221002120 |
4 | 3223023211021302200001 |
5 | 4104242233422004121 |
6 | 54212255040234453 |
7 | 3255426215162364 |
oct | 353134511624001 |
9 | 63200615157076 |
10 | 16161511516161 |
11 | 5171070a15040 |
12 | 199026160ba29 |
13 | 903040949b9b |
14 | 3dc3154920db |
15 | 1d05e83d9bc6 |
hex | eb2e5272801 |
16161511516161 has 32 divisors (see below), whose sum is σ = 24055475338752. Its totient is φ = 9566617656960.
The previous prime is 16161511516123. The next prime is 16161511516219.
16161511516161 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 16161511516161 - 29 = 16161511515649 is a prime.
It is a super-2 number, since 2×161615115161612 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (16161511516261) 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, 31178046 + ... + 31692168.
It is an arithmetic number, because the mean of its divisors is an integer number (751733604336).
Almost surely, 216161511516161 is an apocalyptic number.
16161511516161 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
16161511516161 is a deficient number, since it is larger than the sum of its proper divisors (7893963822591).
16161511516161 is a wasteful number, since it uses less digits than its factorization.
16161511516161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 536333.
The product of its digits is 32400, while the sum is 42.
The spelling of 16161511516161 in words is "sixteen trillion, one hundred sixty-one billion, five hundred eleven million, five hundred sixteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •