Base | Representation |
---|---|
bin | 1110111101000101111101… |
… | …1001110111011011101001 |
3 | 2011012220120111120201020110 |
4 | 3233101133121313123221 |
5 | 4123344210232102012 |
6 | 54545404404444533 |
7 | 3314643212026161 |
oct | 357213731673351 |
9 | 64186514521213 |
10 | 16442735425257 |
11 | 526a363539339 |
12 | 1a168669a9749 |
13 | 92370a816b1b |
14 | 40bb92aa35a1 |
15 | 1d7aa74dc73c |
hex | ef45f6776e9 |
16442735425257 has 64 divisors (see below), whose sum is σ = 23112449280000. Its totient is φ = 10383234183168.
The previous prime is 16442735425247. The next prime is 16442735425273. The reversal of 16442735425257 is 75252453724461.
It is not a de Polignac number, because 16442735425257 - 228 = 16442466989801 is a prime.
It is a super-3 number, since 3×164427354252573 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 16442735425197 and 16442735425206.
It is not an unprimeable number, because it can be changed into a prime (16442735425247) 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 63 ways as a sum of consecutive naturals, for example, 1473489844 + ... + 1473501002.
It is an arithmetic number, because the mean of its divisors is an integer number (361132020000).
Almost surely, 216442735425257 is an apocalyptic number.
It is an amenable number.
16442735425257 is a deficient number, since it is larger than the sum of its proper divisors (6669713854743).
16442735425257 is a wasteful number, since it uses less digits than its factorization.
16442735425257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12270.
The product of its digits is 56448000, while the sum is 57.
The spelling of 16442735425257 in words is "sixteen trillion, four hundred forty-two billion, seven hundred thirty-five million, four hundred twenty-five thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •