Base | Representation |
---|---|
bin | 1100101101000110… |
… | …01101010101000010 |
3 | 122121100111111020200 |
4 | 12112203031111002 |
5 | 102432104414310 |
6 | 3044452550030 |
7 | 331011445011 |
oct | 62643152502 |
9 | 18540444220 |
10 | 6820779330 |
11 | 2990174512 |
12 | 13a4322316 |
13 | 849145a01 |
14 | 489c26a78 |
15 | 29dc169c0 |
hex | 1968cd542 |
6820779330 has 96 divisors (see below), whose sum is σ = 18044208000. Its totient is φ = 1787318016.
The previous prime is 6820779281. The next prime is 6820779331. The reversal of 6820779330 is 339770286.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (6820779331) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1335121 + ... + 1340219.
It is an arithmetic number, because the mean of its divisors is an integer number (187960500).
Almost surely, 26820779330 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6820779330, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9022104000).
6820779330 is an abundant number, since it is smaller than the sum of its proper divisors (11223428670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6820779330 is a wasteful number, since it uses less digits than its factorization.
6820779330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5368 (or 5365 counting only the distinct ones).
The product of its (nonzero) digits is 381024, while the sum is 45.
The square root of 6820779330 is about 82588.0096018786. The cubic root of 6820779330 is about 1896.4642766913.
The spelling of 6820779330 in words is "six billion, eight hundred twenty million, seven hundred seventy-nine thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •