Base | Representation |
---|---|
bin | 111100101111001000… |
… | …010111100100011001 |
3 | 20020022221222001111101 |
4 | 330233020113210121 |
5 | 2032030044413111 |
6 | 45543124431401 |
7 | 4466044220353 |
oct | 745710274431 |
9 | 206287861441 |
10 | 65215232281 |
11 | 25726331291 |
12 | 10780548561 |
13 | 61c4077354 |
14 | 32293800d3 |
15 | 1a6a521bc1 |
hex | f2f217919 |
65215232281 has 2 divisors, whose sum is σ = 65215232282. Its totient is φ = 65215232280.
The previous prime is 65215232279. The next prime is 65215232419. The reversal of 65215232281 is 18223251256.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 48022777881 + 17192454400 = 219141^2 + 131120^2 .
It is a cyclic number.
It is not a de Polignac number, because 65215232281 - 21 = 65215232279 is a prime.
It is a super-2 number, since 2×652152322812 (a number of 22 digits) contains 22 as substring.
Together with 65215232279, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 65215232281.
It is not a weakly prime, because it can be changed into another prime (65215232231) 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, 32607616140 + 32607616141.
It is an arithmetic number, because the mean of its divisors is an integer number (32607616141).
Almost surely, 265215232281 is an apocalyptic number.
It is an amenable number.
65215232281 is a deficient number, since it is larger than the sum of its proper divisors (1).
65215232281 is an equidigital number, since it uses as much as digits as its factorization.
65215232281 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 57600, while the sum is 37.
The spelling of 65215232281 in words is "sixty-five billion, two hundred fifteen million, two hundred thirty-two thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •