Base | Representation |
---|---|
bin | 1110111011010100010010… |
… | …0100100001100000101001 |
3 | 2011002222210212022000122112 |
4 | 3232311010210201200221 |
5 | 4122344211414310040 |
6 | 54523400415132105 |
7 | 3312513060106103 |
oct | 356650444414051 |
9 | 64088725260575 |
10 | 16412220463145 |
11 | 5258424649691 |
12 | 1a1096b514035 |
13 | 92088685b620 |
14 | 40a4da0ca573 |
15 | 1d6dbd592365 |
hex | eed44921829 |
16412220463145 has 8 divisors (see below), whose sum is σ = 21209638752456. Its totient is φ = 12119793572736.
The previous prime is 16412220463117. The next prime is 16412220463153. The reversal of 16412220463145 is 54136402221461.
It can be written as a sum of positive squares in 4 ways, for example, as 1648889696281 + 14763330766864 = 1284091^2 + 3842308^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 16412220463145 - 218 = 16412220201001 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 126247849652 + ... + 126247849781.
It is an arithmetic number, because the mean of its divisors is an integer number (2651204844057).
Almost surely, 216412220463145 is an apocalyptic number.
It is an amenable number.
16412220463145 is a deficient number, since it is larger than the sum of its proper divisors (4797418289311).
16412220463145 is a wasteful number, since it uses less digits than its factorization.
16412220463145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252495699451.
The product of its (nonzero) digits is 276480, while the sum is 41.
The spelling of 16412220463145 in words is "sixteen trillion, four hundred twelve billion, two hundred twenty million, four hundred sixty-three thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •