Base | Representation |
---|---|
bin | 1111010010110… |
… | …1101110110100 |
3 | 11110201011212200 |
4 | 3310231232310 |
5 | 112410303302 |
6 | 10210544500 |
7 | 1406161362 |
oct | 364555664 |
9 | 143634780 |
10 | 64150452 |
11 | 33236203 |
12 | 19598130 |
13 | 103a1162 |
14 | 873c632 |
15 | 597281c |
hex | 3d2dbb4 |
64150452 has 72 divisors (see below), whose sum is σ = 176399496. Its totient is φ = 19574784.
The previous prime is 64150447. The next prime is 64150483. The reversal of 64150452 is 25405146.
64150452 is a `hidden beast` number, since 64 + 150 + 452 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 27499536 + 36650916 = 5244^2 + 6054^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 21228 + ... + 24060.
It is an arithmetic number, because the mean of its divisors is an integer number (2449993).
Almost surely, 264150452 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 64150452, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (88199748).
64150452 is an abundant number, since it is smaller than the sum of its proper divisors (112249044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64150452 is a wasteful number, since it uses less digits than its factorization.
64150452 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2897 (or 2892 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The square root of 64150452 is about 8009.3977301667. The cubic root of 64150452 is about 400.3131963727.
Adding to 64150452 its reverse (25405146), we get a palindrome (89555598).
The spelling of 64150452 in words is "sixty-four million, one hundred fifty thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •