Base | Representation |
---|---|
bin | 100101110001010010… |
… | …100111101000100000 |
3 | 10212200101011101112022 |
4 | 211301102213220200 |
5 | 1131024141141000 |
6 | 30344135121012 |
7 | 2634000212525 |
oct | 456122475040 |
9 | 125611141468 |
10 | 40555412000 |
11 | 16221522324 |
12 | 7a39b13168 |
13 | 3a9416920c |
14 | 1d6a26914c |
15 | 10c5648585 |
hex | 9714a7a20 |
40555412000 has 192 divisors, whose sum is σ = 101292871680. Its totient is φ = 15956352000.
The previous prime is 40555411993. The next prime is 40555412003. The reversal of 40555412000 is 21455504.
It is not an unprimeable number, because it can be changed into a prime (40555412003) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 83275757 + ... + 83276243.
It is an arithmetic number, because the mean of its divisors is an integer number (527567040).
Almost surely, 240555412000 is an apocalyptic number.
40555412000 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 40555412000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (50646435840).
40555412000 is an abundant number, since it is smaller than the sum of its proper divisors (60737459680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40555412000 is a wasteful number, since it uses less digits than its factorization.
40555412000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 812 (or 794 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 26.
Adding to 40555412000 its reverse (21455504), we get a palindrome (40576867504).
The spelling of 40555412000 in words is "forty billion, five hundred fifty-five million, four hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •