Base | Representation |
---|---|
bin | 100101010000011100… |
… | …011010101101111101 |
3 | 10211020222012122110020 |
4 | 211100130122231331 |
5 | 1123412102114123 |
6 | 30213331402353 |
7 | 2614226133513 |
oct | 452034325575 |
9 | 124228178406 |
10 | 40004332413 |
11 | 15a69448051 |
12 | 79054533b9 |
13 | 3a06c3b516 |
14 | 1d16db84b3 |
15 | 10920907e3 |
hex | 95071ab7d |
40004332413 has 4 divisors (see below), whose sum is σ = 53339109888. Its totient is φ = 26669554940.
The previous prime is 40004332393. The next prime is 40004332421. The reversal of 40004332413 is 31423340004.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 40004332413 - 234 = 22824463229 is a prime.
It is a super-2 number, since 2×400043324132 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40004332453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6667388733 + ... + 6667388738.
It is an arithmetic number, because the mean of its divisors is an integer number (13334777472).
Almost surely, 240004332413 is an apocalyptic number.
It is an amenable number.
40004332413 is a deficient number, since it is larger than the sum of its proper divisors (13334777475).
40004332413 is a wasteful number, since it uses less digits than its factorization.
40004332413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13334777474.
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 40004332413 its reverse (31423340004), we get a palindrome (71427672417).
The spelling of 40004332413 in words is "forty billion, four million, three hundred thirty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •