Base | Representation |
---|---|
bin | 1110111001111111… |
… | …0110000101011101 |
3 | 101022212012101120020 |
4 | 3232133312011131 |
5 | 31143314403110 |
6 | 1501014142353 |
7 | 201104463510 |
oct | 35637660535 |
9 | 11285171506 |
10 | 4001325405 |
11 | 177370a000 |
12 | 9380519b9 |
13 | 4b9c96a8c |
14 | 29d5bad77 |
15 | 186437d70 |
hex | ee7f615d |
4001325405 has 64 divisors (see below), whose sum is σ = 8048111616. Its totient is φ = 1662830400.
The previous prime is 4001325389. The next prime is 4001325407. The reversal of 4001325405 is 5045231004.
4001325405 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4001325405 - 24 = 4001325389 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4001325407) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 125440 + ... + 154070.
It is an arithmetic number, because the mean of its divisors is an integer number (125751744).
Almost surely, 24001325405 is an apocalyptic number.
It is an amenable number.
4001325405 is an abundant number, since it is smaller than the sum of its proper divisors (4046786211).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4001325405 is a wasteful number, since it uses less digits than its factorization.
4001325405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28679 (or 28657 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 24.
The square root of 4001325405 is about 63256.0305820718. The cubic root of 4001325405 is about 1587.5763617142.
Adding to 4001325405 its reverse (5045231004), we get a palindrome (9046556409).
The spelling of 4001325405 in words is "four billion, one million, three hundred twenty-five thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •