Base | Representation |
---|---|
bin | 11110000110100011… |
… | …01111110111011001 |
3 | 1112201021222112020200 |
4 | 33003101233313121 |
5 | 231044221032023 |
6 | 11231352412413 |
7 | 1111326116121 |
oct | 170321576731 |
9 | 45637875220 |
10 | 16161111513 |
11 | 6943587308 |
12 | 31703a7109 |
13 | 16a72758a1 |
14 | ad450dc81 |
15 | 648c1c743 |
hex | 3c346fdd9 |
16161111513 has 6 divisors (see below), whose sum is σ = 23343827754. Its totient is φ = 10774074336.
The previous prime is 16161111511. The next prime is 16161111553. The reversal of 16161111513 is 31511116161.
It can be written as a sum of positive squares in only one way, i.e., 14164094169 + 1997017344 = 119013^2 + 44688^2 .
It is not a de Polignac number, because 16161111513 - 21 = 16161111511 is a prime.
It is a super-2 number, since 2×161611115132 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (16161111511) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 897839520 + ... + 897839537.
It is an arithmetic number, because the mean of its divisors is an integer number (3890637959).
Almost surely, 216161111513 is an apocalyptic number.
It is an amenable number.
16161111513 is a deficient number, since it is larger than the sum of its proper divisors (7182716241).
16161111513 is a wasteful number, since it uses less digits than its factorization.
16161111513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1795679063 (or 1795679060 counting only the distinct ones).
The product of its digits is 540, while the sum is 27.
Adding to 16161111513 its reverse (31511116161), we get a palindrome (47672227674).
The spelling of 16161111513 in words is "sixteen billion, one hundred sixty-one million, one hundred eleven thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •