Base | Representation |
---|---|
bin | 11001001000011… |
… | …11001110011100 |
3 | 112200201002002120 |
4 | 30210033032130 |
5 | 412432414030 |
6 | 32530422540 |
7 | 5136664320 |
oct | 1444171634 |
9 | 480632076 |
10 | 210826140 |
11 | a9007888 |
12 | 5a731a50 |
13 | 348a7bc5 |
14 | 1dddd980 |
15 | 13797010 |
hex | c90f39c |
210826140 has 48 divisors (see below), whose sum is σ = 674644992. Its totient is φ = 48188736.
The previous prime is 210826139. The next prime is 210826157. The reversal of 210826140 is 41628012.
210826140 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2108261402 = 88895322614599200, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 210826140.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 250564 + ... + 251403.
It is an arithmetic number, because the mean of its divisors is an integer number (14055104).
Almost surely, 2210826140 is an apocalyptic number.
210826140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210826140 is an abundant number, since it is smaller than the sum of its proper divisors (463818852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210826140 is a wasteful number, since it uses less digits than its factorization.
210826140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 501986 (or 501984 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 24.
The square root of 210826140 is about 14519.8533050441. The cubic root of 210826140 is about 595.1706216892.
The spelling of 210826140 in words is "two hundred ten million, eight hundred twenty-six thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •