Base | Representation |
---|---|
bin | 100101010000011000… |
… | …100101000000110101 |
3 | 10211020220022111220212 |
4 | 211100120211000311 |
5 | 1123411322413010 |
6 | 30213254035205 |
7 | 2614214442416 |
oct | 452030450065 |
9 | 124226274825 |
10 | 40003326005 |
11 | 15a6891aa05 |
12 | 7905048b05 |
13 | 3a06978406 |
14 | 1d16bd580d |
15 | 1091e42505 |
hex | 950625035 |
40003326005 has 8 divisors (see below), whose sum is σ = 48190778712. Its totient is φ = 31878135808.
The previous prime is 40003325993. The next prime is 40003326007. The reversal of 40003326005 is 50062330004.
It can be written as a sum of positive squares in 4 ways, for example, as 11374009201 + 28629316804 = 106649^2 + 169202^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 40003326005 - 26 = 40003325941 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 (40003326007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15564212 + ... + 15566781.
It is an arithmetic number, because the mean of its divisors is an integer number (6023847339).
Almost surely, 240003326005 is an apocalyptic number.
It is an amenable number.
40003326005 is a deficient number, since it is larger than the sum of its proper divisors (8187452707).
40003326005 is a wasteful number, since it uses less digits than its factorization.
40003326005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31131255.
The product of its (nonzero) digits is 2160, while the sum is 23.
Adding to 40003326005 its reverse (50062330004), we get a palindrome (90065656009).
The spelling of 40003326005 in words is "forty billion, three million, three hundred twenty-six thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •