Base | Representation |
---|---|
bin | 10010010000000100011100… |
… | …11000010010000110011000 |
3 | 12021002211022201012222211220 |
4 | 21020002032120102012120 |
5 | 20230031041131102323 |
6 | 221205321435252040 |
7 | 11311424613642120 |
oct | 1110021630220630 |
9 | 167084281188756 |
10 | 40134563144088 |
11 | 11873a77652966 |
12 | 460241bbaa020 |
13 | 1951899953b4a |
14 | 9ca747a09c80 |
15 | 498ed34930e3 |
hex | 24808e612198 |
40134563144088 has 32 divisors (see below), whose sum is σ = 114670180412160. Its totient is φ = 11467018041120.
The previous prime is 40134563144077. The next prime is 40134563144089. The reversal of 40134563144088 is 88044136543104.
It is a super-2 number, since 2×401345631440882 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 40134563144088.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40134563144089) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 119448104428 + ... + 119448104763.
It is an arithmetic number, because the mean of its divisors is an integer number (3583443137880).
Almost surely, 240134563144088 is an apocalyptic number.
It is an amenable number.
40134563144088 is an abundant number, since it is smaller than the sum of its proper divisors (74535617268072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40134563144088 is a wasteful number, since it uses less digits than its factorization.
40134563144088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238896209207 (or 238896209203 counting only the distinct ones).
The product of its (nonzero) digits is 4423680, while the sum is 51.
The spelling of 40134563144088 in words is "forty trillion, one hundred thirty-four billion, five hundred sixty-three million, one hundred forty-four thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •