Base | Representation |
---|---|
bin | 1111000011010010… |
… | …0100110010011100 |
3 | 101102120120012212201 |
4 | 3300310210302130 |
5 | 31233310022022 |
6 | 1504525541244 |
7 | 202060050100 |
oct | 36064446234 |
9 | 11376505781 |
10 | 4040314012 |
11 | 1793719799 |
12 | 949114824 |
13 | 4c5098167 |
14 | 2a4849900 |
15 | 189a8a127 |
hex | f0d24c9c |
4040314012 has 72 divisors (see below), whose sum is σ = 8472404304. Its totient is φ = 1679747328.
The previous prime is 4040313997. The next prime is 4040314039. The reversal of 4040314012 is 2104130404.
It is a super-2 number, since 2×40403140122 = 32648274631127072288, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3386088 + ... + 3387280.
It is an arithmetic number, because the mean of its divisors is an integer number (117672282).
Almost surely, 24040314012 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 4040314012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4236202152).
4040314012 is an abundant number, since it is smaller than the sum of its proper divisors (4432090292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4040314012 is a wasteful number, since it uses less digits than its factorization.
4040314012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1715 (or 1706 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 19.
The square root of 4040314012 is about 63563.4644430273. The cubic root of 4040314012 is about 1592.7161112339.
Adding to 4040314012 its reverse (2104130404), we get a palindrome (6144444416).
The spelling of 4040314012 in words is "four billion, forty million, three hundred fourteen thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •