Base | Representation |
---|---|
bin | 1111100100101… |
… | …1010001000001 |
3 | 11112220121012022 |
4 | 3321023101001 |
5 | 113210220001 |
6 | 10252011225 |
7 | 1422132215 |
oct | 371132101 |
9 | 145817168 |
10 | 65320001 |
11 | 3396497a |
12 | 19a60b15 |
13 | 106c05b6 |
14 | 8964945 |
15 | 5b0411b |
hex | 3e4b441 |
65320001 has 4 divisors (see below), whose sum is σ = 69162372. Its totient is φ = 61477632.
The previous prime is 65319997. The next prime is 65320027. The reversal of 65320001 is 10002356.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 28729600 + 36590401 = 5360^2 + 6049^2 .
It is a cyclic number.
It is not a de Polignac number, because 65320001 - 22 = 65319997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17), and also a Moran number because the ratio is a prime number: 3842353 = 65320001 / (6 + 5 + 3 + 2 + 0 + 0 + 0 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (65320051) 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, 1921160 + ... + 1921193.
It is an arithmetic number, because the mean of its divisors is an integer number (17290593).
Almost surely, 265320001 is an apocalyptic number.
It is an amenable number.
65320001 is a deficient number, since it is larger than the sum of its proper divisors (3842371).
65320001 is a wasteful number, since it uses less digits than its factorization.
65320001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3842370.
The product of its (nonzero) digits is 180, while the sum is 17.
The square root of 65320001 is about 8082.0790023360. The cubic root of 65320001 is about 402.7313095049.
Adding to 65320001 its reverse (10002356), we get a palindrome (75322357).
The spelling of 65320001 in words is "sixty-five million, three hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •