Base | Representation |
---|---|
bin | 111010101011011000011… |
… | …101110101100111110001 |
3 | 112021111002200120210101221 |
4 | 322223120131311213301 |
5 | 1012031133110232423 |
6 | 12324230151225041 |
7 | 564216266116441 |
oct | 72533035654761 |
9 | 15244080523357 |
10 | 4032311024113 |
11 | 13151034a6289 |
12 | 5515a4978181 |
13 | 233325bc5708 |
14 | dd244686121 |
15 | 6ed52931e5d |
hex | 3aad87759f1 |
4032311024113 has 8 divisors (see below), whose sum is σ = 4040294747688. Its totient is φ = 4024333282944.
The previous prime is 4032311024107. The next prime is 4032311024117. The reversal of 4032311024113 is 3114201132304.
It can be written as a sum of positive squares in 4 ways, for example, as 2256776094049 + 1775534930064 = 1502257^2 + 1332492^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4032311024113 - 237 = 3894872070641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4032311024117) 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, 145006 + ... + 2843527.
It is an arithmetic number, because the mean of its divisors is an integer number (505036843461).
Almost surely, 24032311024113 is an apocalyptic number.
It is an amenable number.
4032311024113 is a deficient number, since it is larger than the sum of its proper divisors (7983723575).
4032311024113 is a wasteful number, since it uses less digits than its factorization.
4032311024113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2991203.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 4032311024113 its reverse (3114201132304), we get a palindrome (7146512156417).
The spelling of 4032311024113 in words is "four trillion, thirty-two billion, three hundred eleven million, twenty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •