Base | Representation |
---|---|
bin | 1111010010111… |
… | …0001000011010 |
3 | 11110201021010100 |
4 | 3310232020122 |
5 | 112410331330 |
6 | 10211000230 |
7 | 1406166222 |
oct | 364561032 |
9 | 143637110 |
10 | 64152090 |
11 | 33237462 |
12 | 19599076 |
13 | 103a1b22 |
14 | 873d082 |
15 | 5973060 |
hex | 3d2e21a |
64152090 has 48 divisors (see below), whose sum is σ = 168690600. Its totient is φ = 16912896.
The previous prime is 64152079. The next prime is 64152107. The reversal of 64152090 is 9025146.
64152090 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 46335249 + 17816841 = 6807^2 + 4221^2 .
It is a Curzon 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 23 ways as a sum of consecutive naturals, for example, 4006 + ... + 12014.
Almost surely, 264152090 is an apocalyptic number.
It is a pronic number, being equal to 8009×8010.
It is a practical number, because each smaller number is the sum of distinct divisors of 64152090, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (84345300).
64152090 is an abundant number, since it is smaller than the sum of its proper divisors (104538510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64152090 is a wasteful number, since it uses less digits than its factorization.
64152090 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8111 (or 8108 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 64152090 is about 8009.4999843935. The cubic root of 64152090 is about 400.3166035061.
The spelling of 64152090 in words is "sixty-four million, one hundred fifty-two thousand, ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •