Base | Representation |
---|---|
bin | 1111010001011… |
… | …0110000011100 |
3 | 11110112101210100 |
4 | 3310112300130 |
5 | 112344300343 |
6 | 10204541100 |
7 | 1405320126 |
oct | 364266034 |
9 | 143471710 |
10 | 64056348 |
11 | 33181534 |
12 | 19551790 |
13 | 1036a385 |
14 | 8716216 |
15 | 59549d3 |
hex | 3d16c1c |
64056348 has 36 divisors (see below), whose sum is σ = 162170008. Its totient is φ = 21319200.
The previous prime is 64056269. The next prime is 64056371. The reversal of 64056348 is 84365046.
64056348 is a `hidden beast` number, since 640 + 5 + 6 + 3 + 4 + 8 = 666.
64056348 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 36990 + ... + 38682.
Almost surely, 264056348 is an apocalyptic number.
It is an amenable number.
64056348 is an abundant number, since it is smaller than the sum of its proper divisors (98113660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64056348 is a wasteful number, since it uses less digits than its factorization.
64056348 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2754 (or 2749 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 36.
The square root of 64056348 is about 8003.5209751709. The cubic root of 64056348 is about 400.1173572315.
The spelling of 64056348 in words is "sixty-four million, fifty-six thousand, three hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •