Base | Representation |
---|---|
bin | 100101011000000011… |
… | …010111011110000000 |
3 | 10211120212101222110100 |
4 | 211120003113132000 |
5 | 1124142241430412 |
6 | 30234131402400 |
7 | 2620336141365 |
oct | 453003273600 |
9 | 124525358410 |
10 | 40131983232 |
11 | 16024504aa0 |
12 | 7940153400 |
13 | 3a27513953 |
14 | 1d29d2646c |
15 | 109d3a7edc |
hex | 9580d7780 |
40131983232 has 384 divisors, whose sum is σ = 134120020320. Its totient is φ = 11383603200.
The previous prime is 40131983209. The next prime is 40131983257. The reversal of 40131983232 is 23238913104.
40131983232 is a `hidden beast` number, since 401 + 3 + 19 + 8 + 3 + 232 = 666.
It is a tau number, because it is divible by the number of its divisors (384).
It is a super-2 number, since 2×401319832322 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 51916798 + ... + 51917570.
Almost surely, 240131983232 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 40131983232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67060010160).
40131983232 is an abundant number, since it is smaller than the sum of its proper divisors (93988037088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40131983232 is a wasteful number, since it uses less digits than its factorization.
40131983232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1062 (or 1047 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 36.
The spelling of 40131983232 in words is "forty billion, one hundred thirty-one million, nine hundred eighty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •