Base | Representation |
---|---|
bin | 111011100111000001… |
… | …011100100010000001 |
3 | 20010012122120011020100 |
4 | 323213001130202001 |
5 | 2022040344124144 |
6 | 45223111033013 |
7 | 4424054262651 |
oct | 734701344201 |
9 | 203178504210 |
10 | 64005458049 |
11 | 25165459a75 |
12 | 104a336b769 |
13 | 6060540000 |
14 | 3152828361 |
15 | 19e9205269 |
hex | ee705c881 |
64005458049 has 45 divisors (see below), whose sum is σ = 100357535733. Its totient is φ = 39309040368.
The previous prime is 64005458047. The next prime is 64005458059. The reversal of 64005458049 is 94085450046.
The square root of 64005458049 is 252993.
It is a perfect power (a square), and thus also a powerful number.
64005458049 is a `hidden beast` number, since 64 + 0 + 0 + 5 + 4 + 580 + 4 + 9 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 31734928449 + 32270529600 = 178143^2 + 179640^2 .
It is not a de Polignac number, because 64005458049 - 21 = 64005458047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 64005457995 and 64005458013.
It is not an unprimeable number, because it can be changed into a prime (64005458047) by changing a digit.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 128267202 + ... + 128267700.
Almost surely, 264005458049 is an apocalyptic number.
64005458049 is the 252993-rd square number.
64005458049 is the 126497-th centered octagonal number.
It is an amenable number.
64005458049 is a deficient number, since it is larger than the sum of its proper divisors (36352077684).
64005458049 is an frugal number, since it uses more digits than its factorization.
64005458049 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1056 (or 515 counting only the distinct ones).
The product of its (nonzero) digits is 691200, while the sum is 45.
The spelling of 64005458049 in words is "sixty-four billion, five million, four hundred fifty-eight thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •