Base | Representation |
---|---|
bin | 1110110110101100001110… |
… | …0011111011000111000000 |
3 | 2010211101200012021011220120 |
4 | 3231223003203323013000 |
5 | 4120043431114234124 |
6 | 54423054335140240 |
7 | 3304000454520246 |
oct | 355530343730700 |
9 | 63741605234816 |
10 | 16332746633664 |
11 | 522775175427a |
12 | 19b948b974680 |
13 | 91622c742816 |
14 | 40671b19a796 |
15 | 1d4cbb3aad79 |
hex | edac38fb1c0 |
16332746633664 has 56 divisors (see below), whose sum is σ = 43214060709120. Its totient is φ = 5444206642944.
The previous prime is 16332746633629. The next prime is 16332746633717. The reversal of 16332746633664 is 46633664723361.
It is a happy number.
It is a super-2 number, since 2×163327466336642 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 16332746633598 and 16332746633607.
It is a congruent number.
It is an unprimeable number.
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, 33485167 + ... + 33969425.
It is an arithmetic number, because the mean of its divisors is an integer number (771679655520).
Almost surely, 216332746633664 is an apocalyptic number.
It is an amenable number.
16332746633664 is an abundant number, since it is smaller than the sum of its proper divisors (26881314075456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16332746633664 is a wasteful number, since it uses less digits than its factorization.
16332746633664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 659937 (or 659927 counting only the distinct ones).
The product of its digits is 141087744, while the sum is 60.
The spelling of 16332746633664 in words is "sixteen trillion, three hundred thirty-two billion, seven hundred forty-six million, six hundred thirty-three thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •