Base | Representation |
---|---|
bin | 111100101011001111… |
… | …101111010001110101 |
3 | 20020011102022201211001 |
4 | 330223033233101311 |
5 | 2031411403234131 |
6 | 45532435443301 |
7 | 4464323222614 |
oct | 745317572165 |
9 | 206142281731 |
10 | 65150055541 |
11 | 256a256500a |
12 | 10762756531 |
13 | 61b370702c |
14 | 322085587b |
15 | 1a6494a261 |
hex | f2b3ef475 |
65150055541 has 2 divisors, whose sum is σ = 65150055542. Its totient is φ = 65150055540.
The previous prime is 65150055493. The next prime is 65150055547. The reversal of 65150055541 is 14555005156.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 39716504100 + 25433551441 = 199290^2 + 159479^2 .
It is a cyclic number.
It is not a de Polignac number, because 65150055541 - 27 = 65150055413 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 65150055541.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (65150055547) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32575027770 + 32575027771.
It is an arithmetic number, because the mean of its divisors is an integer number (32575027771).
Almost surely, 265150055541 is an apocalyptic number.
It is an amenable number.
65150055541 is a deficient number, since it is larger than the sum of its proper divisors (1).
65150055541 is an equidigital number, since it uses as much as digits as its factorization.
65150055541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75000, while the sum is 37.
The spelling of 65150055541 in words is "sixty-five billion, one hundred fifty million, fifty-five thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •