Base | Representation |
---|---|
bin | 1100110101111010… |
… | …11101000111100000 |
3 | 122210111201112110022 |
4 | 12122331131013200 |
5 | 103110030043413 |
6 | 3100054453012 |
7 | 332600365130 |
oct | 63275350740 |
9 | 18714645408 |
10 | 6894768608 |
11 | 2a18a0a782 |
12 | 1405064168 |
13 | 85b580250 |
14 | 4959a6ac0 |
15 | 2a547e608 |
hex | 19af5d1e0 |
6894768608 has 384 divisors, whose sum is σ = 18776862720. Its totient is φ = 2415329280.
The previous prime is 6894768553. The next prime is 6894768611. The reversal of 6894768608 is 8068674986.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 87275513 + ... + 87275591.
It is an arithmetic number, because the mean of its divisors is an integer number (48898080).
Almost surely, 26894768608 is an apocalyptic number.
6894768608 is a gapful number since it is divisible by the number (68) 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 6894768608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9388431360).
6894768608 is an abundant number, since it is smaller than the sum of its proper divisors (11882094112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6894768608 is a wasteful number, since it uses less digits than its factorization.
6894768608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 210 (or 202 counting only the distinct ones).
The product of its (nonzero) digits is 27869184, while the sum is 62.
The square root of 6894768608 is about 83034.7433789013. The cubic root of 6894768608 is about 1903.2970093829.
The spelling of 6894768608 in words is "six billion, eight hundred ninety-four million, seven hundred sixty-eight thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •