Base | Representation |
---|---|
bin | 1100101101101111… |
… | …11100010010100000 |
3 | 122121201201121222111 |
4 | 12112313330102200 |
5 | 102440002331220 |
6 | 3045205245104 |
7 | 331105603114 |
oct | 62667742240 |
9 | 18551647874 |
10 | 6826214560 |
11 | 2993247040 |
12 | 13a6103794 |
13 | 84a2c9919 |
14 | 48a83d744 |
15 | 29e43c15a |
hex | 196dfc4a0 |
6826214560 has 96 divisors (see below), whose sum is σ = 17791099200. Its totient is φ = 2454312960.
The previous prime is 6826214537. The next prime is 6826214581. The reversal of 6826214560 is 654126286.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 134851 + ... + 178429.
It is an arithmetic number, because the mean of its divisors is an integer number (185323950).
Almost surely, 26826214560 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 6826214560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8895549600).
6826214560 is an abundant number, since it is smaller than the sum of its proper divisors (10964884640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6826214560 is a wasteful number, since it uses less digits than its factorization.
6826214560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43694 (or 43686 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 40.
The square root of 6826214560 is about 82620.9087338066. The cubic root of 6826214560 is about 1896.9678839917.
The spelling of 6826214560 in words is "six billion, eight hundred twenty-six million, two hundred fourteen thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •