Base | Representation |
---|---|
bin | 1011110001010000011… |
… | …11111101110111000000 |
3 | 1102122211111002022010021 |
4 | 11320220033331313000 |
5 | 23111203430400000 |
6 | 505440234343224 |
7 | 41134314661231 |
oct | 5705017756700 |
9 | 1378744068107 |
10 | 404402200000 |
11 | 146562554417 |
12 | 6646158ab14 |
13 | 2c19a691806 |
14 | 15804ad1088 |
15 | a7bd11911a |
hex | 5e283fddc0 |
404402200000 has 84 divisors (see below), whose sum is σ = 1003043316744. Its totient is φ = 161760800000.
The previous prime is 404402199997. The next prime is 404402200001. The reversal of 404402200000 is 2204404.
It is a super-2 number, since 2×4044022000002 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (404402200001) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 811006 + ... + 1211005.
It is an arithmetic number, because the mean of its divisors is an integer number (11940991866).
Almost surely, 2404402200000 is an apocalyptic number.
404402200000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
404402200000 is an abundant number, since it is smaller than the sum of its proper divisors (598641116744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
404402200000 is an frugal number, since it uses more digits than its factorization.
404402200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2022048 (or 2022018 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 16.
Adding to 404402200000 its reverse (2204404), we get a palindrome (404404404404).
The spelling of 404402200000 in words is "four hundred four billion, four hundred two million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •