Base | Representation |
---|---|
bin | 1100101100001100… |
… | …10000111101000000 |
3 | 122120211020000101110 |
4 | 12112012100331000 |
5 | 102423134121000 |
6 | 3044022203320 |
7 | 330560114346 |
oct | 62606207500 |
9 | 18524200343 |
10 | 6813192000 |
11 | 2986961a9a |
12 | 13a1883540 |
13 | 8476ba374 |
14 | 488c0d996 |
15 | 29d218850 |
hex | 196190f40 |
6813192000 has 224 divisors, whose sum is σ = 23821948800. Its totient is φ = 1709875200.
The previous prime is 6813191989. The next prime is 6813192013. The reversal of 6813192000 is 2913186.
It is a Harshad number since it is a multiple of its sum of digits (30).
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 31 ways as a sum of consecutive naturals, for example, 399651 + ... + 416349.
Almost surely, 26813192000 is an apocalyptic number.
6813192000 is a gapful number since it is divisible by the number (60) 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 6813192000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11910974400).
6813192000 is an abundant number, since it is smaller than the sum of its proper divisors (17008756800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6813192000 is a wasteful number, since it uses less digits than its factorization.
6813192000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16746 (or 16726 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 30.
The square root of 6813192000 is about 82542.0620047743. The cubic root of 6813192000 is about 1895.7608165583.
The spelling of 6813192000 in words is "six billion, eight hundred thirteen million, one hundred ninety-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •