Base | Representation |
---|---|
bin | 1111010010011… |
… | …1111000000001 |
3 | 11110122221222021 |
4 | 3310213320001 |
5 | 112404021330 |
6 | 10210241441 |
7 | 1406031424 |
oct | 364477001 |
9 | 143587867 |
10 | 64126465 |
11 | 3321a187 |
12 | 19586281 |
13 | 10393270 |
14 | 87339bb |
15 | 596a67a |
hex | 3d27e01 |
64126465 has 32 divisors (see below), whose sum is σ = 88615296. Its totient is φ = 44129280.
The previous prime is 64126457. The next prime is 64126477. The reversal of 64126465 is 56462146.
64126465 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 64126465 - 23 = 64126457 is a prime.
It is a super-2 number, since 2×641264652 = 8224407026792450, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 64126465.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 144534 + ... + 144976.
It is an arithmetic number, because the mean of its divisors is an integer number (2769228).
Almost surely, 264126465 is an apocalyptic number.
64126465 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
64126465 is a deficient number, since it is larger than the sum of its proper divisors (24488831).
64126465 is a wasteful number, since it uses less digits than its factorization.
64126465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 609.
The product of its digits is 34560, while the sum is 34.
The square root of 64126465 is about 8007.9001617153. The cubic root of 64126465 is about 400.2632954008.
The spelling of 64126465 in words is "sixty-four million, one hundred twenty-six thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •