Base | Representation |
---|---|
bin | 11110100110001100… |
… | …01001001101010101 |
3 | 1120101210100220201202 |
4 | 33103012021031111 |
5 | 232120141130140 |
6 | 11313553002245 |
7 | 1121030663156 |
oct | 172306111525 |
9 | 46353326652 |
10 | 16426505045 |
11 | 6a6a374405 |
12 | 3225253385 |
13 | 171a247a92 |
14 | b1b87592d |
15 | 662192915 |
hex | 3d3189355 |
16426505045 has 8 divisors (see below), whose sum is σ = 19725608760. Its totient is φ = 13132002240.
The previous prime is 16426505023. The next prime is 16426505047. The reversal of 16426505045 is 54050562461.
16426505045 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 1226820676 + 15199684369 = 35026^2 + 123287^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-16426505045 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16426505047) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1142366 + ... + 1156655.
It is an arithmetic number, because the mean of its divisors is an integer number (2465701095).
Almost surely, 216426505045 is an apocalyptic number.
It is an amenable number.
16426505045 is a deficient number, since it is larger than the sum of its proper divisors (3299103715).
16426505045 is a wasteful number, since it uses less digits than its factorization.
16426505045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2300455.
The product of its (nonzero) digits is 144000, while the sum is 38.
The spelling of 16426505045 in words is "sixteen billion, four hundred twenty-six million, five hundred five thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •