Base | Representation |
---|---|
bin | 1111001001000000… |
… | …1101010101101100 |
3 | 101111020202121202210 |
4 | 3302100031111230 |
5 | 31310432211322 |
6 | 1511144450420 |
7 | 202501164540 |
oct | 36220152554 |
9 | 11436677683 |
10 | 4064335212 |
11 | 17a6236223 |
12 | 955179a10 |
13 | 4ca0589a2 |
14 | 2a7adda20 |
15 | 18bc3270c |
hex | f240d56c |
4064335212 has 48 divisors (see below), whose sum is σ = 10868497920. Its totient is φ = 1157995392.
The previous prime is 4064335141. The next prime is 4064335229. The reversal of 4064335212 is 2125334604.
It is a self number, because there is not a number n which added to its sum of digits gives 4064335212.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 37233 + ... + 97544.
It is an arithmetic number, because the mean of its divisors is an integer number (226427040).
Almost surely, 24064335212 is an apocalyptic number.
4064335212 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
4064335212 is an abundant number, since it is smaller than the sum of its proper divisors (6804162708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4064335212 is a wasteful number, since it uses less digits than its factorization.
4064335212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135150 (or 135148 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 30.
The square root of 4064335212 is about 63752.1388817662. The cubic root of 4064335212 is about 1595.8663103073.
Adding to 4064335212 its reverse (2125334604), we get a palindrome (6189669816).
It can be divided in two parts, 40643 and 35212, that added together give a triangular number (75855 = T389).
The spelling of 4064335212 in words is "four billion, sixty-four million, three hundred thirty-five thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •