Base | Representation |
---|---|
bin | 10101101100001110111000 |
3 | 101200220000000 |
4 | 111230032320 |
5 | 2423424300 |
6 | 321513000 |
7 | 66221562 |
oct | 25541670 |
9 | 11626000 |
10 | 5686200 |
11 | 3234143 |
12 | 1aa2760 |
13 | 1241220 |
14 | a80332 |
15 | 774c00 |
hex | 56c3b8 |
5686200 has 192 divisors, whose sum is σ = 21352800. Its totient is φ = 1399680.
The previous prime is 5686193. The next prime is 5686217. The reversal of 5686200 is 26865.
5686200 is digitally balanced in base 4, 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 (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 437394 + ... + 437406.
Almost surely, 25686200 is an apocalyptic number.
5686200 is a gapful number since it is divisible by the number (50) 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 5686200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10676400).
5686200 is an abundant number, since it is smaller than the sum of its proper divisors (15666600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5686200 is a wasteful number, since it uses less digits than its factorization.
5686200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50 (or 23 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The square root of 5686200 is about 2384.5754339085. The cubic root of 5686200 is about 178.4873234413.
It can be divided in two parts, 5686 and 200, that added together give a triangular number (5886 = T108).
The spelling of 5686200 in words is "five million, six hundred eighty-six thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •