Base | Representation |
---|---|
bin | 1110111100100101110110… |
… | …1001111100111011010111 |
3 | 2011012002022210220022120101 |
4 | 3233021131221330323113 |
5 | 4123224032213344142 |
6 | 54541421223514531 |
7 | 3314216501311525 |
oct | 357113551747327 |
9 | 64162283808511 |
10 | 16434116153047 |
11 | 526674014a57a |
12 | 1a150602b8a47 |
13 | 922965bbb058 |
14 | 40b5b6077315 |
15 | 1d77509690b7 |
hex | ef25da7ced7 |
16434116153047 has 4 divisors (see below), whose sum is σ = 16434151389256. Its totient is φ = 16434080916840.
The previous prime is 16434116153029. The next prime is 16434116153053. The reversal of 16434116153047 is 74035161143461.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16434116153047 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16434116152988 and 16434116153006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16434116153027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16908993 + ... + 17854474.
It is an arithmetic number, because the mean of its divisors is an integer number (4108537847314).
Almost surely, 216434116153047 is an apocalyptic number.
16434116153047 is a deficient number, since it is larger than the sum of its proper divisors (35236209).
16434116153047 is an equidigital number, since it uses as much as digits as its factorization.
16434116153047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35236208.
The product of its (nonzero) digits is 725760, while the sum is 46.
The spelling of 16434116153047 in words is "sixteen trillion, four hundred thirty-four billion, one hundred sixteen million, one hundred fifty-three thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •