Base | Representation |
---|---|
bin | 1111000001011011… |
… | …0100100001011100 |
3 | 101102000212221110120 |
4 | 3300112310201130 |
5 | 31224310423030 |
6 | 1504050434540 |
7 | 201633542664 |
oct | 36026644134 |
9 | 11360787416 |
10 | 4032514140 |
11 | 178a281616 |
12 | 946592a50 |
13 | 4c3596b55 |
14 | 2a37b91a4 |
15 | 189049010 |
hex | f05b485c |
4032514140 has 48 divisors (see below), whose sum is σ = 11299771392. Its totient is φ = 1074505536.
The previous prime is 4032514117. The next prime is 4032514147. The reversal of 4032514140 is 414152304.
It is a super-2 number, since 2×40325141402 = 32522340578599879200, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4032514140.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4032514147) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54297 + ... + 104943.
It is an arithmetic number, because the mean of its divisors is an integer number (235411904).
Almost surely, 24032514140 is an apocalyptic number.
It is an amenable number.
4032514140 is an abundant number, since it is smaller than the sum of its proper divisors (7267257252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4032514140 is a wasteful number, since it uses less digits than its factorization.
4032514140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51986 (or 51984 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 24.
The square root of 4032514140 is about 63502.0798084598. The cubic root of 4032514140 is about 1591.6905321507.
Adding to 4032514140 its reverse (414152304), we get a palindrome (4446666444).
The spelling of 4032514140 in words is "four billion, thirty-two million, five hundred fourteen thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •