Base | Representation |
---|---|
bin | 100101011101010100… |
… | …110011101011010100 |
3 | 10211211000212010010002 |
4 | 211131110303223110 |
5 | 1124332413110200 |
6 | 30251011350432 |
7 | 2622462052544 |
oct | 453524635324 |
9 | 124730763102 |
10 | 40220441300 |
11 | 1606a432936 |
12 | 79658b2418 |
13 | 3a3c945ac0 |
14 | 1d37991324 |
15 | 10a602cbd5 |
hex | 95d533ad4 |
40220441300 has 144 divisors (see below), whose sum is σ = 96757140480. Its totient is φ = 14417948160.
The previous prime is 40220441299. The next prime is 40220441309. The reversal of 40220441300 is 314402204.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40220441309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9668621 + ... + 9672779.
Almost surely, 240220441300 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 40220441300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48378570240).
40220441300 is an abundant number, since it is smaller than the sum of its proper divisors (56536699180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40220441300 is a wasteful number, since it uses less digits than its factorization.
40220441300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4402 (or 4395 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 20.
Adding to 40220441300 its reverse (314402204), we get a palindrome (40534843504).
The spelling of 40220441300 in words is "forty billion, two hundred twenty million, four hundred forty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •