Base | Representation |
---|---|
bin | 1110101100101110010100… |
… | …1001110010011000000001 |
3 | 2010020000200112011220101121 |
4 | 3223023211021302120001 |
5 | 4104242233422000044 |
6 | 54212255040232241 |
7 | 3255426215161033 |
oct | 353134511623001 |
9 | 63200615156347 |
10 | 16161511515649 |
11 | 5171070a14715 |
12 | 199026160b681 |
13 | 903040949896 |
14 | 3dc315491c53 |
15 | 1d05e83d9984 |
hex | eb2e5272601 |
16161511515649 has 2 divisors, whose sum is σ = 16161511515650. Its totient is φ = 16161511515648.
The previous prime is 16161511515607. The next prime is 16161511515661. The reversal of 16161511515649 is 94651511516161.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11612112599025 + 4549398916624 = 3407655^2 + 2132932^2 .
It is a cyclic number.
It is not a de Polignac number, because 16161511515649 - 213 = 16161511507457 is a prime.
It is a super-2 number, since 2×161615115156492 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 16161511515596 and 16161511515605.
It is not a weakly prime, because it can be changed into another prime (16161511512649) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8080755757824 + 8080755757825.
It is an arithmetic number, because the mean of its divisors is an integer number (8080755757825).
Almost surely, 216161511515649 is an apocalyptic number.
It is an amenable number.
16161511515649 is a deficient number, since it is larger than the sum of its proper divisors (1).
16161511515649 is an equidigital number, since it uses as much as digits as its factorization.
16161511515649 is an evil number, because the sum of its binary digits is even.
The product of its digits is 972000, while the sum is 52.
The spelling of 16161511515649 in words is "sixteen trillion, one hundred sixty-one billion, five hundred eleven million, five hundred fifteen thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •