Base | Representation |
---|---|
bin | 11011001000000… |
… | …101011000000000 |
3 | 1011201100200022201 |
4 | 123020011120000 |
5 | 1413001312000 |
6 | 113054242544 |
7 | 14164214551 |
oct | 3310053000 |
9 | 1151320281 |
10 | 455104000 |
11 | 21399240a |
12 | 1084b6454 |
13 | 73395c10 |
14 | 4462a328 |
15 | 29e4a96a |
hex | 1b205600 |
455104000 has 160 divisors (see below), whose sum is σ = 1224359136. Its totient is φ = 167731200.
The previous prime is 455103953. The next prime is 455104003. The reversal of 455104000 is 401554.
It is a tau number, because it is divible by the number of its divisors (160).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (455104003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 831727 + ... + 832273.
Almost surely, 2455104000 is an apocalyptic number.
455104000 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 455104000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (612179568).
455104000 is an abundant number, since it is smaller than the sum of its proper divisors (769255136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
455104000 is an equidigital number, since it uses as much as digits as its factorization.
455104000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 593 (or 567 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 19.
The square root of 455104000 is about 21333.1666660156. The cubic root of 455104000 is about 769.1957645609.
Adding to 455104000 its reverse (401554), we get a palindrome (455505554).
The spelling of 455104000 in words is "four hundred fifty-five million, one hundred four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •