Base | Representation |
---|---|
bin | 10010010101010001110101… |
… | …11010011000001000110101 |
3 | 12021201221022201020121022022 |
4 | 21022220322322120020311 |
5 | 20240444123131001010 |
6 | 221423442335242525 |
7 | 11330362246130141 |
oct | 1112507272301065 |
9 | 167657281217268 |
10 | 40313551422005 |
11 | 11932976895294 |
12 | 4631052979445 |
13 | 1965722ab5874 |
14 | 9d52872c6221 |
15 | 49d9abe51d55 |
hex | 24aa3ae98235 |
40313551422005 has 8 divisors (see below), whose sum is σ = 51221924159832. Its totient is φ = 30353732835328.
The previous prime is 40313551421999. The next prime is 40313551422013. The reversal of 40313551422005 is 50022415531304.
It can be written as a sum of positive squares in 4 ways, for example, as 7489165649956 + 32824385772049 = 2736634^2 + 5729257^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 40313551422005 - 216 = 40313551356469 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 7 ways as a sum of consecutive naturals, for example, 237138537692 + ... + 237138537861.
It is an arithmetic number, because the mean of its divisors is an integer number (6402740519979).
Almost surely, 240313551422005 is an apocalyptic number.
It is an amenable number.
40313551422005 is a deficient number, since it is larger than the sum of its proper divisors (10908372737827).
40313551422005 is a wasteful number, since it uses less digits than its factorization.
40313551422005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 474277075575.
The product of its (nonzero) digits is 72000, while the sum is 35.
Adding to 40313551422005 its reverse (50022415531304), we get a palindrome (90335966953309).
The spelling of 40313551422005 in words is "forty trillion, three hundred thirteen billion, five hundred fifty-one million, four hundred twenty-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •