Base | Representation |
---|---|
bin | 110010001110100… |
… | …111101100011000 |
3 | 2011201200021000200 |
4 | 302032213230120 |
5 | 3211212142100 |
6 | 215341502200 |
7 | 26611530033 |
oct | 6216475430 |
9 | 2151607020 |
10 | 842693400 |
11 | 3a275102a |
12 | 1b6271960 |
13 | 105780663 |
14 | 7dcc001a |
15 | 4deabe00 |
hex | 323a7b18 |
842693400 has 144 divisors (see below), whose sum is σ = 2996627400. Its totient is φ = 211491840.
The previous prime is 842693363. The next prime is 842693407. The reversal of 842693400 is 4396248.
It is a happy number.
842693400 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 (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (842693407) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 16831 + ... + 44369.
Almost surely, 2842693400 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 842693400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1498313700).
842693400 is an abundant number, since it is smaller than the sum of its proper divisors (2153934000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
842693400 is a wasteful number, since it uses less digits than its factorization.
842693400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27578 (or 27566 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 36.
The square root of 842693400 is about 29029.1818692846. The cubic root of 842693400 is about 944.5461833754.
The spelling of 842693400 in words is "eight hundred forty-two million, six hundred ninety-three thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •