Base | Representation |
---|---|
bin | 10010001100011100011100… |
… | …11111111100101110011110 |
3 | 12020122220211110120200200010 |
4 | 21012032032133330232132 |
5 | 20221011000320231420 |
6 | 221032202332544050 |
7 | 11266425242025240 |
oct | 1106161637745636 |
9 | 166586743520603 |
10 | 40010011102110 |
11 | 11826172232285 |
12 | 45a225b922026 |
13 | 1942c0a67131a |
14 | 9c46cdccc090 |
15 | 495b43a6e4e0 |
hex | 24638e7fcb9e |
40010011102110 has 192 divisors, whose sum is σ = 117415577986560. Its totient is φ = 8545271592960.
The previous prime is 40010011102097. The next prime is 40010011102111. The reversal of 40010011102110 is 1120111001004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40010011102111) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 6064500 + ... + 10807320.
It is an arithmetic number, because the mean of its divisors is an integer number (611539468680).
Almost surely, 240010011102110 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40010011102110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (58707788993280).
40010011102110 is an abundant number, since it is smaller than the sum of its proper divisors (77405566884450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40010011102110 is a wasteful number, since it uses less digits than its factorization.
40010011102110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4743011 (or 4742994 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 40010011102110 its reverse (1120111001004), we get a palindrome (41130122103114).
The spelling of 40010011102110 in words is "forty trillion, ten billion, eleven million, one hundred two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •