Base | Representation |
---|---|
bin | 100101101000010110… |
… | …001000111101101001 |
3 | 10212021220202221110102 |
4 | 211220112020331221 |
5 | 1130222231340014 |
6 | 30321214355145 |
7 | 2630165503046 |
oct | 455026107551 |
9 | 125256687412 |
10 | 40405340009 |
11 | 16154840a91 |
12 | 79b77bbab5 |
13 | 3a6c043618 |
14 | 1d543621cd |
15 | 10b73a28de |
hex | 968588f69 |
40405340009 has 8 divisors (see below), whose sum is σ = 40916209320. Its totient is φ = 39896395776.
The previous prime is 40405339991. The next prime is 40405340021. The reversal of 40405340009 is 90004350404.
It can be written as a sum of positive squares in 4 ways, for example, as 646176400 + 39759163609 = 25420^2 + 199397^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 40405340009 - 228 = 40136904553 is a prime.
It is a super-2 number, since 2×404053400092 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40405340099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 439004 + ... + 523005.
It is an arithmetic number, because the mean of its divisors is an integer number (5114526165).
Almost surely, 240405340009 is an apocalyptic number.
It is an amenable number.
40405340009 is a deficient number, since it is larger than the sum of its proper divisors (510869311).
40405340009 is an equidigital number, since it uses as much as digits as its factorization.
40405340009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 962539.
The product of its (nonzero) digits is 8640, while the sum is 29.
The spelling of 40405340009 in words is "forty billion, four hundred five million, three hundred forty thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •