Base | Representation |
---|---|
bin | 10010011100010011110100… |
… | …01000011100010101100101 |
3 | 12022121000212202102012201211 |
4 | 21032021322020130111211 |
5 | 20303423401320224110 |
6 | 222130434123551421 |
7 | 11354003635203652 |
oct | 1116117210342545 |
9 | 168530782365654 |
10 | 40555130242405 |
11 | 11a1637482a679 |
12 | 466ba3308b571 |
13 | 19824422b5a3c |
14 | a02c43514c29 |
15 | 4a4dea7c698a |
hex | 24e27a21c565 |
40555130242405 has 4 divisors (see below), whose sum is σ = 48666156290892. Its totient is φ = 32444104193920.
The previous prime is 40555130242399. The next prime is 40555130242481. The reversal of 40555130242405 is 50424203155504.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 23039683201089 + 17515447041316 = 4799967^2 + 4185146^2 .
It is not a de Polignac number, because 40555130242405 - 25 = 40555130242373 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4055513024236 + ... + 4055513024245.
It is an arithmetic number, because the mean of its divisors is an integer number (12166539072723).
Almost surely, 240555130242405 is an apocalyptic number.
It is an amenable number.
40555130242405 is a deficient number, since it is larger than the sum of its proper divisors (8111026048487).
40555130242405 is an equidigital number, since it uses as much as digits as its factorization.
40555130242405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8111026048486.
The product of its (nonzero) digits is 480000, while the sum is 40.
Adding to 40555130242405 its reverse (50424203155504), we get a palindrome (90979333397909).
The spelling of 40555130242405 in words is "forty trillion, five hundred fifty-five billion, one hundred thirty million, two hundred forty-two thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •