Base | Representation |
---|---|
bin | 1110100101111010101000… |
… | …0110101110100001011101 |
3 | 2002210211210202010202100012 |
4 | 3221132222012232201131 |
5 | 4100333223011200301 |
6 | 54042433445413005 |
7 | 3244116034040546 |
oct | 351365206564135 |
9 | 62724722122305 |
10 | 16044556740701 |
11 | 5126504aaa215 |
12 | 197166170a165 |
13 | 8c4cc261c938 |
14 | 3d67bc7654cd |
15 | 1cc55095cebb |
hex | e97aa1ae85d |
16044556740701 has 2 divisors, whose sum is σ = 16044556740702. Its totient is φ = 16044556740700.
The previous prime is 16044556740683. The next prime is 16044556740731. The reversal of 16044556740701 is 10704765544061.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15436640244601 + 607916496100 = 3928949^2 + 779690^2 .
It is a cyclic number.
It is not a de Polignac number, because 16044556740701 - 238 = 15769678833757 is a prime.
It is a super-2 number, since 2×160445567407012 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 16044556740701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16044556740731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8022278370350 + 8022278370351.
It is an arithmetic number, because the mean of its divisors is an integer number (8022278370351).
Almost surely, 216044556740701 is an apocalyptic number.
It is an amenable number.
16044556740701 is a deficient number, since it is larger than the sum of its proper divisors (1).
16044556740701 is an equidigital number, since it uses as much as digits as its factorization.
16044556740701 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2822400, while the sum is 50.
The spelling of 16044556740701 in words is "sixteen trillion, forty-four billion, five hundred fifty-six million, seven hundred forty thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •