Base | Representation |
---|---|
bin | 1011110000100110110… |
… | …00000011110100000000 |
3 | 1102121221002010022000220 |
4 | 11320103120003310000 |
5 | 23104444303000000 |
6 | 505341404343040 |
7 | 41122533222045 |
oct | 5702330036400 |
9 | 1377832108026 |
10 | 404052000000 |
11 | 1463a2902a30 |
12 | 66384244a80 |
13 | 2c142c6858c |
14 | 157b03b11cc |
15 | a79c4e11a0 |
hex | 5e13603d00 |
404052000000 has 504 divisors, whose sum is σ = 1466870598816. Its totient is φ = 97920000000.
The previous prime is 404051999971. The next prime is 404052000007. The reversal of 404052000000 is 250404.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (404052000007) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 131998470 + ... + 132001530.
Almost surely, 2404052000000 is an apocalyptic number.
404052000000 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 404052000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (733435299408).
404052000000 is an abundant number, since it is smaller than the sum of its proper divisors (1062818598816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
404052000000 is an frugal number, since it uses more digits than its factorization.
404052000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3121 (or 3082 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 15.
Adding to 404052000000 its reverse (250404), we get a palindrome (404052250404).
The spelling of 404052000000 in words is "four hundred four billion, fifty-two million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •