Base | Representation |
---|---|
bin | 1111001000111100… |
… | …1010001101011100 |
3 | 101111020020122121002 |
4 | 3302033022031130 |
5 | 31310344412002 |
6 | 1511134525432 |
7 | 202465641110 |
oct | 36217121534 |
9 | 11436218532 |
10 | 4064060252 |
11 | 17a606868a |
12 | 955066878 |
13 | 4c9c907a5 |
14 | 2a7a6b740 |
15 | 18bbcb002 |
hex | f23ca35c |
4064060252 has 48 divisors (see below), whose sum is σ = 8593536000. Its totient is φ = 1642814784.
The previous prime is 4064060237. The next prime is 4064060263. The reversal of 4064060252 is 2520604604.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 105149 + ... + 138507.
It is an arithmetic number, because the mean of its divisors is an integer number (179032000).
Almost surely, 24064060252 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 4064060252, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4296768000).
4064060252 is an abundant number, since it is smaller than the sum of its proper divisors (4529475748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4064060252 is a wasteful number, since it uses less digits than its factorization.
4064060252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33618 (or 33616 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 29.
The square root of 4064060252 is about 63749.9823686250. The cubic root of 4064060252 is about 1595.8303216996.
Adding to 4064060252 its reverse (2520604604), we get a palindrome (6584664856).
The spelling of 4064060252 in words is "four billion, sixty-four million, sixty thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.261 sec. • engine limits •