Base | Representation |
---|---|
bin | 111010101011011101110… |
… | …101111101000111000100 |
3 | 112021111022222022211210210 |
4 | 322223131311331013010 |
5 | 1012031324203413244 |
6 | 12324243132515420 |
7 | 564221442640233 |
oct | 72533565750704 |
9 | 15244288284723 |
10 | 4032401232324 |
11 | 131514a40a023 |
12 | 55160b01bb70 |
13 | 23333b7bb35a |
14 | dd252648b1a |
15 | 6ed5a8004b9 |
hex | 3aaddd7d1c4 |
4032401232324 has 24 divisors (see below), whose sum is σ = 9733382285760. Its totient is φ = 1297784304544.
The previous prime is 4032401232323. The next prime is 4032401232337. The reversal of 4032401232324 is 4232321042304.
It is a super-2 number, since 2×40324012323242 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4032401232291 and 4032401232300.
It is not an unprimeable number, because it can be changed into a prime (4032401232323) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5793679584 + ... + 5793680279.
It is an arithmetic number, because the mean of its divisors is an integer number (405557595240).
Almost surely, 24032401232324 is an apocalyptic number.
It is an amenable number.
4032401232324 is an abundant number, since it is smaller than the sum of its proper divisors (5700981053436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4032401232324 is a wasteful number, since it uses less digits than its factorization.
4032401232324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11587359899 (or 11587359897 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 30.
Adding to 4032401232324 its reverse (4232321042304), we get a palindrome (8264722274628).
The spelling of 4032401232324 in words is "four trillion, thirty-two billion, four hundred one million, two hundred thirty-two thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •