Base | Representation |
---|---|
bin | 1100111010001001… |
… | …10101101110000000 |
3 | 122212222111121212110 |
4 | 12131010311232000 |
5 | 103143121240231 |
6 | 3103403255320 |
7 | 333511141125 |
oct | 63504655600 |
9 | 18788447773 |
10 | 6930258816 |
11 | 2a36a50028 |
12 | 1414b1a540 |
13 | 865a28180 |
14 | 49a5a474c |
15 | 2a8640046 |
hex | 19d135b80 |
6930258816 has 256 divisors, whose sum is σ = 21550233600. Its totient is φ = 1954160640.
The previous prime is 6930258781. The next prime is 6930258817. The reversal of 6930258816 is 6188520396.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6930258817) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2939110 + ... + 2941466.
It is an arithmetic number, because the mean of its divisors is an integer number (84180600).
Almost surely, 26930258816 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 6930258816, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10775116800).
6930258816 is an abundant number, since it is smaller than the sum of its proper divisors (14619974784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6930258816 is a wasteful number, since it uses less digits than its factorization.
6930258816 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2437 (or 2425 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 48.
The square root of 6930258816 is about 83248.1760520914. The cubic root of 6930258816 is about 1906.5571060871.
The spelling of 6930258816 in words is "six billion, nine hundred thirty million, two hundred fifty-eight thousand, eight hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •