Base | Representation |
---|---|
bin | 100101011000011110… |
… | …000110100110000000 |
3 | 10211121100121001200100 |
4 | 211120132012212000 |
5 | 1124201040221000 |
6 | 30234541522400 |
7 | 2620452542202 |
oct | 453036064600 |
9 | 124540531610 |
10 | 40138992000 |
11 | 16028461868 |
12 | 7942573400 |
13 | 3a28ac8b53 |
14 | 1d2ac2c772 |
15 | 109dcdea00 |
hex | 958786980 |
40138992000 has 192 divisors, whose sum is σ = 144149672160. Its totient is φ = 10703692800.
The previous prime is 40138991969. The next prime is 40138992059. The reversal of 40138992000 is 29983104.
It is a tau number, because it is divible by the number of its divisors (192).
It is a super-2 number, since 2×401389920002 (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 23 ways as a sum of consecutive naturals, for example, 4629 + ... + 283371.
Almost surely, 240138992000 is an apocalyptic number.
40138992000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40138992000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72074836080).
40138992000 is an abundant number, since it is smaller than the sum of its proper divisors (104010680160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40138992000 is a wasteful number, since it uses less digits than its factorization.
40138992000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 278778 (or 278753 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 36.
The spelling of 40138992000 in words is "forty billion, one hundred thirty-eight million, nine hundred ninety-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •