Base | Representation |
---|---|
bin | 10010010000000000101110… |
… | …11000001011111101110100 |
3 | 12021002122011120102120202022 |
4 | 21020000113120023331310 |
5 | 20230012444024132020 |
6 | 221204351355132312 |
7 | 11311324261600106 |
oct | 1110002730137564 |
9 | 167078146376668 |
10 | 40132566630260 |
11 | 11873142677535 |
12 | 4601b63444098 |
13 | 195163c12a510 |
14 | 9ca5d87bb576 |
15 | 498e1806d625 |
hex | 24801760bf74 |
40132566630260 has 384 divisors, whose sum is σ = 97717662282240. Its totient is φ = 13735675699200.
The previous prime is 40132566630253. The next prime is 40132566630301. The reversal of 40132566630260 is 6203666523104.
It is a super-2 number, since 2×401325666302602 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 6614891747 + ... + 6614897813.
It is an arithmetic number, because the mean of its divisors is an integer number (254473078860).
Almost surely, 240132566630260 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40132566630260, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48858831141120).
40132566630260 is an abundant number, since it is smaller than the sum of its proper divisors (57585095651980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40132566630260 is a wasteful number, since it uses less digits than its factorization.
40132566630260 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6467 (or 6465 counting only the distinct ones).
The product of its (nonzero) digits is 933120, while the sum is 44.
The spelling of 40132566630260 in words is "forty trillion, one hundred thirty-two billion, five hundred sixty-six million, six hundred thirty thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •