Base | Representation |
---|---|
bin | 1110101011101001001001… |
… | …0000100110110010000001 |
3 | 2010011020202022100011020001 |
4 | 3222322102100212302001 |
5 | 4103441220334100212 |
6 | 54155544212120001 |
7 | 3254201060565352 |
oct | 352722220466201 |
9 | 63136668304201 |
10 | 16142940925057 |
11 | 5164201341091 |
12 | 198873a306001 |
13 | 90137144993b |
14 | 3db472d75d29 |
15 | 1cedacdc2657 |
hex | eae92426c81 |
16142940925057 has 2 divisors, whose sum is σ = 16142940925058. Its totient is φ = 16142940925056.
The previous prime is 16142940925051. The next prime is 16142940925073. The reversal of 16142940925057 is 75052904924161.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13128744936321 + 3014195988736 = 3623361^2 + 1736144^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16142940925057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16142940924989 and 16142940925007.
It is not a weakly prime, because it can be changed into another prime (16142940925051) 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 as a sum of consecutive naturals, namely, 8071470462528 + 8071470462529.
It is an arithmetic number, because the mean of its divisors is an integer number (8071470462529).
Almost surely, 216142940925057 is an apocalyptic number.
It is an amenable number.
16142940925057 is a deficient number, since it is larger than the sum of its proper divisors (1).
16142940925057 is an equidigital number, since it uses as much as digits as its factorization.
16142940925057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5443200, while the sum is 55.
The spelling of 16142940925057 in words is "sixteen trillion, one hundred forty-two billion, nine hundred forty million, nine hundred twenty-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •