Base | Representation |
---|---|
bin | 111010110101101111010… |
… | …110001001010110111101 |
3 | 112022112210202020020122102 |
4 | 322311233112021112331 |
5 | 1012221422132131023 |
6 | 12333305510554445 |
7 | 565062010325246 |
oct | 72655726112675 |
9 | 15275722206572 |
10 | 4043432302013 |
11 | 13198a0138a45 |
12 | 553789368a25 |
13 | 2343a8ca3820 |
14 | dd9bb6c5ccd |
15 | 702a3e7a628 |
hex | 3ad6f5895bd |
4043432302013 has 8 divisors (see below), whose sum is σ = 4354749025368. Its totient is φ = 3732156074304.
The previous prime is 4043432302003. The next prime is 4043432302057. The reversal of 4043432302013 is 3102032343404.
It can be written as a sum of positive squares in 4 ways, for example, as 139698032644 + 3903734269369 = 373762^2 + 1975787^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 4043432302013 - 218 = 4043432039869 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4043432302003) 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, 9916370 + ... + 10316067.
It is an arithmetic number, because the mean of its divisors is an integer number (544343628171).
Almost surely, 24043432302013 is an apocalyptic number.
It is an amenable number.
4043432302013 is a deficient number, since it is larger than the sum of its proper divisors (311316723355).
4043432302013 is a wasteful number, since it uses less digits than its factorization.
4043432302013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20247823.
The product of its (nonzero) digits is 20736, while the sum is 29.
Adding to 4043432302013 its reverse (3102032343404), we get a palindrome (7145464645417).
The spelling of 4043432302013 in words is "four trillion, forty-three billion, four hundred thirty-two million, three hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •