Base | Representation |
---|---|
bin | 111100000110010010… |
… | …010001100000111001 |
3 | 20011120012111202212001 |
4 | 330012102101200321 |
5 | 2024124132304230 |
6 | 45351125021001 |
7 | 4443053431051 |
oct | 740622214071 |
9 | 204505452761 |
10 | 64529963065 |
11 | 25404533397 |
12 | 1060ab54761 |
13 | 61150c4bc9 |
14 | 31a235c561 |
15 | 1a2a2ae0ca |
hex | f06491839 |
64529963065 has 4 divisors (see below), whose sum is σ = 77435955684. Its totient is φ = 51623970448.
The previous prime is 64529963063. The next prime is 64529963101. The reversal of 64529963065 is 56036992546.
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 8294109184 + 56235853881 = 91072^2 + 237141^2 .
It is a cyclic number.
It is not a de Polignac number, because 64529963065 - 21 = 64529963063 is a prime.
It is a super-2 number, since 2×645299630652 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 64529962997 and 64529963015.
It is not an unprimeable number, because it can be changed into a prime (64529963063) 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, 6452996302 + ... + 6452996311.
It is an arithmetic number, because the mean of its divisors is an integer number (19358988921).
Almost surely, 264529963065 is an apocalyptic number.
It is an amenable number.
64529963065 is a deficient number, since it is larger than the sum of its proper divisors (12905992619).
64529963065 is a wasteful number, since it uses less digits than its factorization.
64529963065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12905992618.
The product of its (nonzero) digits is 10497600, while the sum is 55.
The spelling of 64529963065 in words is "sixty-four billion, five hundred twenty-nine million, nine hundred sixty-three thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •