Base | Representation |
---|---|
bin | 1110110110100111110110… |
… | …1111110110101010011001 |
3 | 2010211021122120022010002110 |
4 | 3231221331233312222121 |
5 | 4120034031242343212 |
6 | 54422342214422533 |
7 | 3303626443026603 |
oct | 355517557665231 |
9 | 63737576263073 |
10 | 16331575356057 |
11 | 5227200586055 |
12 | 19b9203661a49 |
13 | 9160a3b96950 |
14 | 4066497c6173 |
15 | 1d4c4d645a3c |
hex | eda7dbf6a99 |
16331575356057 has 16 divisors (see below), whose sum is σ = 23451997847040. Its totient is φ = 10049544218112.
The previous prime is 16331575355989. The next prime is 16331575356067. The reversal of 16331575356057 is 75065357513361.
It is not a de Polignac number, because 16331575356057 - 27 = 16331575355929 is a prime.
It is a super-2 number, since 2×163315753560572 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 16331575355988 and 16331575356006.
It is not an unprimeable number, because it can be changed into a prime (16331575356067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13061193 + ... + 14256854.
It is an arithmetic number, because the mean of its divisors is an integer number (1465749865440).
Almost surely, 216331575356057 is an apocalyptic number.
It is an amenable number.
16331575356057 is a deficient number, since it is larger than the sum of its proper divisors (7120422490983).
16331575356057 is a wasteful number, since it uses less digits than its factorization.
16331575356057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27333392.
The product of its (nonzero) digits is 29767500, while the sum is 57.
The spelling of 16331575356057 in words is "sixteen trillion, three hundred thirty-one billion, five hundred seventy-five million, three hundred fifty-six thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •