Base | Representation |
---|---|
bin | 111010101011001100100… |
… | …100010110001111101101 |
3 | 112021110120202222001002220 |
4 | 322223030210112033231 |
5 | 1012030231004412023 |
6 | 12324154300505553 |
7 | 564211323303600 |
oct | 72531444261755 |
9 | 15243522861086 |
10 | 4032111404013 |
11 | 13150108527a0 |
12 | 551549b4b2b9 |
13 | 2332c3742304 |
14 | dd225d62337 |
15 | 6ed401503e3 |
hex | 3aacc9163ed |
4032111404013 has 96 divisors (see below), whose sum is σ = 6901819591680. Its totient is φ = 2070245802240.
The previous prime is 4032111403997. The next prime is 4032111404021. The reversal of 4032111404013 is 3104041112304.
It is not a de Polignac number, because 4032111404013 - 24 = 4032111403997 is a prime.
It is a super-2 number, since 2×40321114040132 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4032111404213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 553629670 + ... + 553636952.
It is an arithmetic number, because the mean of its divisors is an integer number (71893954080).
Almost surely, 24032111404013 is an apocalyptic number.
It is an amenable number.
4032111404013 is a deficient number, since it is larger than the sum of its proper divisors (2869708187667).
4032111404013 is a wasteful number, since it uses less digits than its factorization.
4032111404013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11247 (or 11240 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 4032111404013 its reverse (3104041112304), we get a palindrome (7136152516317).
The spelling of 4032111404013 in words is "four trillion, thirty-two billion, one hundred eleven million, four hundred four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •