Base | Representation |
---|---|
bin | 1110110111001001000000… |
… | …1000010101000001110000 |
3 | 2010212010121201002122020010 |
4 | 3231302100020111001300 |
5 | 4120210242231240433 |
6 | 54430413205014520 |
7 | 3304363112463663 |
oct | 355622010250160 |
9 | 63763551078203 |
10 | 16340473696368 |
11 | 522aa57451908 |
12 | 19baa876b4440 |
13 | 916b91571b83 |
14 | 406c514d76da |
15 | 1d50be940e63 |
hex | edc90215070 |
16340473696368 has 80 divisors (see below), whose sum is σ = 42305922247680. Its totient is φ = 5434823106048.
The previous prime is 16340473696319. The next prime is 16340473696373. The reversal of 16340473696368 is 86369637404361.
It is a super-2 number, since 2×163404736963682 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 16340473696299 and 16340473696308.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 224986396 + ... + 225059012.
It is an arithmetic number, because the mean of its divisors is an integer number (528824028096).
Almost surely, 216340473696368 is an apocalyptic number.
It is an amenable number.
16340473696368 is an abundant number, since it is smaller than the sum of its proper divisors (25965448551312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16340473696368 is a wasteful number, since it uses less digits than its factorization.
16340473696368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82894 (or 82888 counting only the distinct ones).
The product of its (nonzero) digits is 282175488, while the sum is 66.
The spelling of 16340473696368 in words is "sixteen trillion, three hundred forty billion, four hundred seventy-three million, six hundred ninety-six thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •