Base | Representation |
---|---|
bin | 1100101110000001… |
… | …10011001001010000 |
3 | 122121220002120221120 |
4 | 12113000303021100 |
5 | 102441101131100 |
6 | 3045331122240 |
7 | 331134413250 |
oct | 62700631120 |
9 | 18556076846 |
10 | 6828536400 |
11 | 2994592514 |
12 | 13a6a43380 |
13 | 84a9306aa |
14 | 48ac85960 |
15 | 29e74a0a0 |
hex | 197033250 |
6828536400 has 120 divisors (see below), whose sum is σ = 24998977344. Its totient is φ = 1560806400.
The previous prime is 6828536383. The next prime is 6828536413. The reversal of 6828536400 is 46358286.
It is a tau number, because it is divible by the number of its divisors (120).
It is a super-2 number, since 2×68285364002 = 93257818732249920000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 398061 + ... + 414860.
Almost surely, 26828536400 is an apocalyptic number.
6828536400 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
6828536400 is an abundant number, since it is smaller than the sum of its proper divisors (18170440944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6828536400 is a wasteful number, since it uses less digits than its factorization.
6828536400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 812949 (or 812938 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 42.
The square root of 6828536400 is about 82634.9587039287. The cubic root of 6828536400 is about 1897.1829351788.
The spelling of 6828536400 in words is "six billion, eight hundred twenty-eight million, five hundred thirty-six thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •