Base | Representation |
---|---|
bin | 11101110001111000101110… |
… | …10010101110011110110101 |
3 | 22120212101012000021110110010 |
4 | 32320330113102232132311 |
5 | 32040404312312201221 |
6 | 351135424100250433 |
7 | 16536122052344526 |
oct | 1670742722563665 |
9 | 276771160243403 |
10 | 65485757147061 |
11 | 19958398776919 |
12 | 74176b36a0a19 |
13 | 2a70385072094 |
14 | 122575589084d |
15 | 78867c802c76 |
hex | 3b8f174ae7b5 |
65485757147061 has 8 divisors (see below), whose sum is σ = 87695628203680. Its totient is φ = 43466528760912.
The previous prime is 65485757147033. The next prime is 65485757147077. The reversal of 65485757147061 is 16074175758456.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 65485757147061 - 25 = 65485757147029 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 65485757146983 and 65485757147001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (65485757157061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47660666815 + ... + 47660668188.
It is an arithmetic number, because the mean of its divisors is an integer number (10961953525460).
Almost surely, 265485757147061 is an apocalyptic number.
It is an amenable number.
65485757147061 is a deficient number, since it is larger than the sum of its proper divisors (22209871056619).
65485757147061 is a wasteful number, since it uses less digits than its factorization.
65485757147061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95321335235.
The product of its (nonzero) digits is 197568000, while the sum is 66.
The spelling of 65485757147061 in words is "sixty-five trillion, four hundred eighty-five billion, seven hundred fifty-seven million, one hundred forty-seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •