Base | Representation |
---|---|
bin | 1111000110001001… |
… | …0011000000000000 |
3 | 101110102010011020220 |
4 | 3301202103000000 |
5 | 31244342043101 |
6 | 1510034503040 |
7 | 202263660030 |
oct | 36142230000 |
9 | 11412104226 |
10 | 4052299776 |
11 | 179a465888 |
12 | 951134a80 |
13 | 4c7703825 |
14 | 2a62898c0 |
15 | 18ab56636 |
hex | f1893000 |
4052299776 has 104 divisors (see below), whose sum is σ = 12348620544. Its totient is φ = 1157775360.
The previous prime is 4052299763. The next prime is 4052299777. The reversal of 4052299776 is 6779922504.
It is a super-2 number, since 2×40522997762 = 32842266949139300352, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4052299777) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62461 + ... + 109571.
It is an arithmetic number, because the mean of its divisors is an integer number (118736736).
Almost surely, 24052299776 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 4052299776, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6174310272).
4052299776 is an abundant number, since it is smaller than the sum of its proper divisors (8296320768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4052299776 is an equidigital number, since it uses as much as digits as its factorization.
4052299776 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47145 (or 47123 counting only the distinct ones).
The product of its (nonzero) digits is 1905120, while the sum is 51.
The square root of 4052299776 is about 63657.6764891714. The cubic root of 4052299776 is about 1594.2895098526.
The spelling of 4052299776 in words is "four billion, fifty-two million, two hundred ninety-nine thousand, seven hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •