Base | Representation |
---|---|
bin | 1100100110111010… |
… | …11000110000000000 |
3 | 122110201220211211000 |
4 | 12103131120300000 |
5 | 102330320442400 |
6 | 3035401252000 |
7 | 326511612210 |
oct | 62335306000 |
9 | 18421824730 |
10 | 6768921600 |
11 | 2963974a91 |
12 | 138aa94000 |
13 | 83b489b6c |
14 | 482da8240 |
15 | 2993c1600 |
hex | 193758c00 |
6768921600 has 528 divisors, whose sum is σ = 28428736000. Its totient is φ = 1546076160.
The previous prime is 6768921587. The next prime is 6768921631. The reversal of 6768921600 is 61298676.
It is a Harshad number since it is a multiple of its sum of digits (45).
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 47 ways as a sum of consecutive naturals, for example, 4837701 + ... + 4839099.
Almost surely, 26768921600 is an apocalyptic number.
6768921600 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 6768921600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14214368000).
6768921600 is an abundant number, since it is smaller than the sum of its proper divisors (21659814400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6768921600 is a wasteful number, since it uses less digits than its factorization.
6768921600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1445 (or 1416 counting only the distinct ones).
The product of its (nonzero) digits is 217728, while the sum is 45.
The square root of 6768921600 is about 82273.4562298193. The cubic root of 6768921600 is about 1891.6458326888.
The spelling of 6768921600 in words is "six billion, seven hundred sixty-eight million, nine hundred twenty-one thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •