Base | Representation |
---|---|
bin | 110010001100110… |
… | …001110111110000 |
3 | 2011200202202000121 |
4 | 302030301313300 |
5 | 3211101221200 |
6 | 215323300024 |
7 | 26604450034 |
oct | 6214616760 |
9 | 2150682017 |
10 | 842210800 |
11 | 3a2451492 |
12 | 1b607a614 |
13 | 105641ab2 |
14 | 7dbd61c4 |
15 | 4de13e1a |
hex | 32331df0 |
842210800 has 60 divisors (see below), whose sum is σ = 2036451256. Its totient is φ = 334713600.
The previous prime is 842210767. The next prime is 842210843. The reversal of 842210800 is 8012248.
842210800 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 56095 + ... + 69505.
Almost surely, 2842210800 is an apocalyptic number.
842210800 is a gapful number since it is divisible by the number (80) 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 842210800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1018225628).
842210800 is an abundant number, since it is smaller than the sum of its proper divisors (1194240456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
842210800 is a wasteful number, since it uses less digits than its factorization.
842210800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13586 (or 13575 counting only the distinct ones).
The product of its (nonzero) digits is 1024, while the sum is 25.
The square root of 842210800 is about 29020.8683536520. The cubic root of 842210800 is about 944.3658390045.
The spelling of 842210800 in words is "eight hundred forty-two million, two hundred ten thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.019 sec. • engine limits •