Base | Representation |
---|---|
bin | 1111000110000111… |
… | …1011001110100100 |
3 | 101110101221012200112 |
4 | 3301201323032210 |
5 | 31244330434104 |
6 | 1510032432152 |
7 | 202263103115 |
oct | 36141731644 |
9 | 11411835615 |
10 | 4052202404 |
11 | 179a3a9708 |
12 | 9510a8658 |
13 | 4c769b403 |
14 | 2a626220c |
15 | 18ab3786e |
hex | f187b3a4 |
4052202404 has 6 divisors (see below), whose sum is σ = 7091354214. Its totient is φ = 2026101200.
The previous prime is 4052202373. The next prime is 4052202437. The reversal of 4052202404 is 4042022504.
It can be written as a sum of positive squares in only one way, i.e., 2500000000 + 1552202404 = 50000^2 + 39398^2 .
It is a super-3 number, since 3×40522024043 (a number of 30 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4052202404.
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 as a sum of consecutive naturals, namely, 506525297 + ... + 506525304.
It is an arithmetic number, because the mean of its divisors is an integer number (1181892369).
Almost surely, 24052202404 is an apocalyptic number.
It is an amenable number.
4052202404 is a deficient number, since it is larger than the sum of its proper divisors (3039151810).
4052202404 is a wasteful number, since it uses less digits than its factorization.
4052202404 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1013050605 (or 1013050603 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 23.
The square root of 4052202404 is about 63656.9116750098. The cubic root of 4052202404 is about 1594.2767401161.
Adding to 4052202404 its reverse (4042022504), we get a palindrome (8094224908).
The spelling of 4052202404 in words is "four billion, fifty-two million, two hundred two thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •