Base | Representation |
---|---|
bin | 1111010110000… |
… | …1001001011001 |
3 | 11111002212202120 |
4 | 3311201021121 |
5 | 112434023144 |
6 | 10215251453 |
7 | 1411026354 |
oct | 365411131 |
9 | 144085676 |
10 | 64361049 |
11 | 3336a455 |
12 | 19679b89 |
13 | 10445c7c |
14 | 879529b |
15 | 59b4e19 |
hex | 3d61259 |
64361049 has 4 divisors (see below), whose sum is σ = 85814736. Its totient is φ = 42907364.
The previous prime is 64361047. The next prime is 64361057. The reversal of 64361049 is 94016346.
64361049 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, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 64361049 - 21 = 64361047 is a prime.
It is a super-3 number, since 3×643610493 (a number of 24 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (64361041) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 10726839 + ... + 10726844.
It is an arithmetic number, because the mean of its divisors is an integer number (21453684).
Almost surely, 264361049 is an apocalyptic number.
It is an amenable number.
64361049 is a deficient number, since it is larger than the sum of its proper divisors (21453687).
64361049 is a wasteful number, since it uses less digits than its factorization.
64361049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21453686.
The product of its (nonzero) digits is 15552, while the sum is 33.
The square root of 64361049 is about 8022.5338266660. The cubic root of 64361049 is about 400.7507753759.
The spelling of 64361049 in words is "sixty-four million, three hundred sixty-one thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •