Base | Representation |
---|---|
bin | 1110100100000100100011… |
… | …1010001111010010100001 |
3 | 2002200210222211120211210220 |
4 | 3221001020322033102201 |
5 | 4044323314443243032 |
6 | 54020112410313253 |
7 | 3241614426222462 |
oct | 351011072172241 |
9 | 62623884524726 |
10 | 16012861306017 |
11 | 511401a830aa4 |
12 | 1967496a28829 |
13 | 8c2010c19264 |
14 | 3d50530a2d69 |
15 | 1cb7e808312c |
hex | e9048e8f4a1 |
16012861306017 has 16 divisors (see below), whose sum is σ = 22622015475072. Its totient is φ = 10040341950720.
The previous prime is 16012861306009. The next prime is 16012861306049. The reversal of 16012861306017 is 71060316821061.
It is not a de Polignac number, because 16012861306017 - 23 = 16012861306009 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 16012861306017.
It is not an unprimeable number, because it can be changed into a prime (16012861306417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 108418834 + ... + 108566427.
It is an arithmetic number, because the mean of its divisors is an integer number (1413875967192).
Almost surely, 216012861306017 is an apocalyptic number.
16012861306017 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
16012861306017 is a deficient number, since it is larger than the sum of its proper divisors (6609154169055).
16012861306017 is a wasteful number, since it uses less digits than its factorization.
16012861306017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216986728.
The product of its (nonzero) digits is 72576, while the sum is 42.
The spelling of 16012861306017 in words is "sixteen trillion, twelve billion, eight hundred sixty-one million, three hundred six thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •