Base | Representation |
---|---|
bin | 1011110001001101101… |
… | …10001100011000000000 |
3 | 1102122202211210200020000 |
4 | 11320212312030120000 |
5 | 23111131414311441 |
6 | 505434034120000 |
7 | 41133610644360 |
oct | 5704666143000 |
9 | 1378684720200 |
10 | 404378666496 |
11 | 146550240342 |
12 | 66455720000 |
13 | 2c195841c6c |
14 | 158019269a0 |
15 | a7bb01b2b6 |
hex | 5e26d8c600 |
404378666496 has 800 divisors, whose sum is σ = 1461344467968. Its totient is φ = 108829163520.
The previous prime is 404378666491. The next prime is 404378666539. The reversal of 404378666496 is 694666873404.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (404378666491) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 474066006 + ... + 474066858.
Almost surely, 2404378666496 is an apocalyptic number.
404378666496 is a gapful number since it is divisible by the number (46) 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 404378666496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (730672233984).
404378666496 is an abundant number, since it is smaller than the sum of its proper divisors (1056965801472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
404378666496 is an equidigital number, since it uses as much as digits as its factorization.
404378666496 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 984 (or 959 counting only the distinct ones).
The product of its (nonzero) digits is 125411328, while the sum is 63.
The spelling of 404378666496 in words is "four hundred four billion, three hundred seventy-eight million, six hundred sixty-six thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •