Base | Representation |
---|---|
bin | 1111000011010001… |
… | …0000010110011101 |
3 | 101102120101222001022 |
4 | 3300310100112131 |
5 | 31233244332201 |
6 | 1504524053525 |
7 | 202056251042 |
oct | 36064202635 |
9 | 11376358038 |
10 | 4040230301 |
11 | 1793671908 |
12 | 9490942a5 |
13 | 4c5069023 |
14 | 2a48271c9 |
15 | 189a7041b |
hex | f0d1059d |
4040230301 has 16 divisors (see below), whose sum is σ = 4250050560. Its totient is φ = 3833372400.
The previous prime is 4040230291. The next prime is 4040230303. The reversal of 4040230301 is 1030320404.
4040230301 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 4040230301 - 226 = 3973121437 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4040230301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4040230303) 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, 2069876 + ... + 2071826.
It is an arithmetic number, because the mean of its divisors is an integer number (265628160).
Almost surely, 24040230301 is an apocalyptic number.
It is an amenable number.
4040230301 is a deficient number, since it is larger than the sum of its proper divisors (209820259).
4040230301 is a wasteful number, since it uses less digits than its factorization.
4040230301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2656.
The product of its (nonzero) digits is 288, while the sum is 17.
The square root of 4040230301 is about 63562.8059559991. The cubic root of 4040230301 is about 1592.7051113645.
Adding to 4040230301 its reverse (1030320404), we get a palindrome (5070550705).
The spelling of 4040230301 in words is "four billion, forty million, two hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •