Base | Representation |
---|---|
bin | 100101011101100110… |
… | …011001010101100000 |
3 | 10211211100112100210202 |
4 | 211131212121111200 |
5 | 1124340103131000 |
6 | 30251254244332 |
7 | 2622546205040 |
oct | 453546312540 |
9 | 124740470722 |
10 | 40225052000 |
11 | 16071aa1a31 |
12 | 79673566a8 |
13 | 3a4089b623 |
14 | 1d38431720 |
15 | 10a663ddd5 |
hex | 95d999560 |
40225052000 has 192 divisors, whose sum is σ = 118898357760. Its totient is φ = 13065408000.
The previous prime is 40225051991. The next prime is 40225052039. The reversal of 40225052000 is 25052204.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 494195 + ... + 569805.
It is an arithmetic number, because the mean of its divisors is an integer number (619262280).
Almost surely, 240225052000 is an apocalyptic number.
40225052000 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 40225052000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (59449178880).
40225052000 is an abundant number, since it is smaller than the sum of its proper divisors (78673305760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40225052000 is a wasteful number, since it uses less digits than its factorization.
40225052000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75662 (or 75644 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 20.
The spelling of 40225052000 in words is "forty billion, two hundred twenty-five million, fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •