Base | Representation |
---|---|
bin | 11101100101011000011011… |
… | …10101000110011110110101 |
3 | 22112100022011120200002012002 |
4 | 32302230031311012132311 |
5 | 32011334344011002001 |
6 | 350210205512105045 |
7 | 16463101563053414 |
oct | 1662541565063665 |
9 | 275308146602162 |
10 | 65056101656501 |
11 | 1980215741553a |
12 | 7368384995185 |
13 | 2a3b9c18519b7 |
14 | 120ca36d2147b |
15 | 77c3d268246b |
hex | 3b2b0dd467b5 |
65056101656501 has 4 divisors (see below), whose sum is σ = 65057105503104. Its totient is φ = 65055097809900.
The previous prime is 65056101656489. The next prime is 65056101656561. The reversal of 65056101656501 is 10565610165056.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 65056101656501 - 230 = 65055027914677 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (65056101656561) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 501826085 + ... + 501955706.
It is an arithmetic number, because the mean of its divisors is an integer number (16264276375776).
Almost surely, 265056101656501 is an apocalyptic number.
It is an amenable number.
65056101656501 is a deficient number, since it is larger than the sum of its proper divisors (1003846603).
65056101656501 is a wasteful number, since it uses less digits than its factorization.
65056101656501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1003846602.
The product of its (nonzero) digits is 810000, while the sum is 47.
The spelling of 65056101656501 in words is "sixty-five trillion, fifty-six billion, one hundred one million, six hundred fifty-six thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •