Base | Representation |
---|---|
bin | 1100110100110011… |
… | …11011010100110000 |
3 | 122202212012100210111 |
4 | 12122121323110300 |
5 | 103100134031102 |
6 | 3055123111104 |
7 | 332425255162 |
oct | 63231732460 |
9 | 18685170714 |
10 | 6885455152 |
11 | 2a13729404 |
12 | 1401b12494 |
13 | 85966c024 |
14 | 494660932 |
15 | 2a473ecd7 |
hex | 19a67b530 |
6885455152 has 80 divisors (see below), whose sum is σ = 14171905440. Its totient is φ = 3235147776.
The previous prime is 6885455147. The next prime is 6885455173. The reversal of 6885455152 is 2515545886.
It is a junction number, because it is equal to n+sod(n) for n = 6885455096 and 6885455105.
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, 8638818 + ... + 8639614.
It is an arithmetic number, because the mean of its divisors is an integer number (177148818).
Almost surely, 26885455152 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 6885455152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7085952720).
6885455152 is an abundant number, since it is smaller than the sum of its proper divisors (7286450288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6885455152 is a wasteful number, since it uses less digits than its factorization.
6885455152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1310 (or 1304 counting only the distinct ones).
The product of its digits is 1920000, while the sum is 49.
The square root of 6885455152 is about 82978.6427461910. The cubic root of 6885455152 is about 1902.4396317822.
The spelling of 6885455152 in words is "six billion, eight hundred eighty-five million, four hundred fifty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •