Base | Representation |
---|---|
bin | 111100111101001111… |
… | …100100001100000001 |
3 | 20020221110111002202012 |
4 | 330331033210030001 |
5 | 2033021203000001 |
6 | 50022423302305 |
7 | 4504650551303 |
oct | 747517441401 |
9 | 206843432665 |
10 | 65452000001 |
11 | 25837a47393 |
12 | 108278aa995 |
13 | 6231135bab |
14 | 324c9b3973 |
15 | 1a811e02bb |
hex | f3d3e4301 |
65452000001 has 4 divisors (see below), whose sum is σ = 67220973012. Its totient is φ = 63683026992.
The previous prime is 65451999961. The next prime is 65452000037. The reversal of 65452000001 is 10000025456.
65452000001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 61536244225 + 3915755776 = 248065^2 + 62576^2 .
It is a cyclic number.
It is not a de Polignac number, because 65452000001 - 26 = 65451999937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (65452000501) 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, 884486450 + ... + 884486523.
It is an arithmetic number, because the mean of its divisors is an integer number (16805243253).
Almost surely, 265452000001 is an apocalyptic number.
It is an amenable number.
65452000001 is a deficient number, since it is larger than the sum of its proper divisors (1768973011).
65452000001 is a wasteful number, since it uses less digits than its factorization.
65452000001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1768973010.
The product of its (nonzero) digits is 1200, while the sum is 23.
Adding to 65452000001 its reverse (10000025456), we get a palindrome (75452025457).
The spelling of 65452000001 in words is "sixty-five billion, four hundred fifty-two million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •