Base | Representation |
---|---|
bin | 1110111000101101110110… |
… | …1001110001100100010010 |
3 | 2010221201111021212022022022 |
4 | 3232023131221301210102 |
5 | 4121131212243112201 |
6 | 54451051310011442 |
7 | 3306342000311462 |
oct | 356133551614422 |
9 | 63851437768268 |
10 | 16367544113426 |
11 | 5240488a50910 |
12 | 1a041814a6b82 |
13 | 9195b6a0902c |
14 | 40829c829ba2 |
15 | 1d5b5628541b |
hex | ee2dda71912 |
16367544113426 has 16 divisors (see below), whose sum is σ = 26819793258048. Its totient is φ = 7429642986000.
The previous prime is 16367544113423. The next prime is 16367544113429. The reversal of 16367544113426 is 62431144576361.
It is an interprime number because it is at equal distance from previous prime (16367544113423) and next prime (16367544113429).
It is a super-2 number, since 2×163675441134262 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (16367544113423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 507473150 + ... + 507505401.
It is an arithmetic number, because the mean of its divisors is an integer number (1676237078628).
Almost surely, 216367544113426 is an apocalyptic number.
16367544113426 is a deficient number, since it is larger than the sum of its proper divisors (10452249144622).
16367544113426 is a wasteful number, since it uses less digits than its factorization.
16367544113426 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1014979297.
The product of its digits is 8709120, while the sum is 53.
Adding to 16367544113426 its reverse (62431144576361), we get a palindrome (78798688689787).
The spelling of 16367544113426 in words is "sixteen trillion, three hundred sixty-seven billion, five hundred forty-four million, one hundred thirteen thousand, four hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •