Base | Representation |
---|---|
bin | 1110111101000011011110… |
… | …0010111001001010011000 |
3 | 2011012211211220021002202110 |
4 | 3233100313202321022120 |
5 | 4123341323033444000 |
6 | 54545214155432320 |
7 | 3314620512004461 |
oct | 357206742711230 |
9 | 64184756232673 |
10 | 16442066703000 |
11 | 526a050012414 |
12 | 1a166baa556a0 |
13 | 923632109193 |
14 | 40bb2bd4bd68 |
15 | 1d7a68947850 |
hex | ef4378b9298 |
16442066703000 has 64 divisors (see below), whose sum is σ = 51299248122720. Its totient is φ = 4384551120000.
The previous prime is 16442066702987. The next prime is 16442066703011. The reversal of 16442066703000 is 30766024461.
It is a happy number.
It is a super-3 number, since 3×164420667030003 (a number of 41 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 16442066703000.
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 15 ways as a sum of consecutive naturals, for example, 2740341451 + ... + 2740347450.
Almost surely, 216442066703000 is an apocalyptic number.
16442066703000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
16442066703000 is an abundant number, since it is smaller than the sum of its proper divisors (34857181419720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16442066703000 is a wasteful number, since it uses less digits than its factorization.
16442066703000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5480688925 (or 5480688911 counting only the distinct ones).
The product of its (nonzero) digits is 145152, while the sum is 39.
The spelling of 16442066703000 in words is "sixteen trillion, four hundred forty-two billion, sixty-six million, seven hundred three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •