Base | Representation |
---|---|
bin | 1100111100101111… |
… | …11111000011011100 |
3 | 122221111111222121200 |
4 | 12132113333003130 |
5 | 103214211230004 |
6 | 3105502355500 |
7 | 334164330636 |
oct | 63627770334 |
9 | 18844458550 |
10 | 6952055004 |
11 | 2a48287904 |
12 | 142028bb90 |
13 | 86a3ba01b |
14 | 49d439a56 |
15 | 2aa4e8239 |
hex | 19e5ff0dc |
6952055004 has 72 divisors (see below), whose sum is σ = 18635722560. Its totient is φ = 2177667072.
The previous prime is 6952054981. The next prime is 6952055083. The reversal of 6952055004 is 4005502596.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 6952055004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 403437 + ... + 420315.
It is an arithmetic number, because the mean of its divisors is an integer number (258829480).
Almost surely, 26952055004 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 6952055004, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9317861280).
6952055004 is an abundant number, since it is smaller than the sum of its proper divisors (11683667556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6952055004 is a wasteful number, since it uses less digits than its factorization.
6952055004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17579 (or 17574 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 36.
The square root of 6952055004 is about 83378.9841866642. The cubic root of 6952055004 is about 1908.5537697487.
The spelling of 6952055004 in words is "six billion, nine hundred fifty-two million, fifty-five thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •