Base | Representation |
---|---|
bin | 1011010011100100… |
… | …00000011001100000 |
3 | 120200000011212220000 |
4 | 11221302000121200 |
5 | 44412314340213 |
6 | 2442142220000 |
7 | 303261314106 |
oct | 55162003140 |
9 | 16600155800 |
10 | 6069683808 |
11 | 26351a6311 |
12 | 1214884600 |
13 | 7596566a6 |
14 | 41818bc76 |
15 | 257ceec73 |
hex | 169c80660 |
6069683808 has 480 divisors, whose sum is σ = 20272545216. Its totient is φ = 1771241472.
The previous prime is 6069683803. The next prime is 6069683881. The reversal of 6069683808 is 8083869606.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6069683803) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 53713960 + ... + 53714072.
Almost surely, 26069683808 is an apocalyptic number.
6069683808 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 6069683808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10136272608).
6069683808 is an abundant number, since it is smaller than the sum of its proper divisors (14202861408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6069683808 is a wasteful number, since it uses less digits than its factorization.
6069683808 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 228 (or 211 counting only the distinct ones).
The product of its (nonzero) digits is 2985984, while the sum is 54.
The square root of 6069683808 is about 77908.1754888407. The cubic root of 6069683808 is about 1824.1281938987.
The spelling of 6069683808 in words is "six billion, sixty-nine million, six hundred eighty-three thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.144 sec. • engine limits •