Base | Representation |
---|---|
bin | 1111010001111111001000… |
… | …1011111101001100010100 |
3 | 2012111020001222201101202220 |
4 | 3310133302023331030110 |
5 | 4200234320130041111 |
6 | 55422330235302340 |
7 | 3352611205165512 |
oct | 364376213751424 |
9 | 65436058641686 |
10 | 16801680315156 |
11 | 5398609578880 |
12 | 1a743408aa9b0 |
13 | 94b51260b3b9 |
14 | 4212c44c34b2 |
15 | 1e20b4983e06 |
hex | f47f22fd314 |
16801680315156 has 24 divisors (see below), whose sum is σ = 42767913529824. Its totient is φ = 5091418277280.
The previous prime is 16801680315143. The next prime is 16801680315163. The reversal of 16801680315156 is 65151308610861.
It is a super-2 number, since 2×168016803151562 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 16801680315099 and 16801680315108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 63642728335 + ... + 63642728598.
It is an arithmetic number, because the mean of its divisors is an integer number (1781996397076).
Almost surely, 216801680315156 is an apocalyptic number.
It is an amenable number.
16801680315156 is an abundant number, since it is smaller than the sum of its proper divisors (25966233214668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16801680315156 is a wasteful number, since it uses less digits than its factorization.
16801680315156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127285456951 (or 127285456949 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 51.
The spelling of 16801680315156 in words is "sixteen trillion, eight hundred one billion, six hundred eighty million, three hundred fifteen thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •