Base | Representation |
---|---|
bin | 110010000100001011101… |
… | …1101010011111101010101 |
3 | 220100210212220221121100200 |
4 | 1210020113131103331111 |
5 | 1400214121334334320 |
6 | 22345020043131113 |
7 | 1310062613615442 |
oct | 144102735237525 |
9 | 26323786847320 |
10 | 6880931168085 |
11 | 2213206293627 |
12 | 9316a1b13a99 |
13 | 3abb3b32b4c0 |
14 | 19b0788409c9 |
15 | bdec7380290 |
hex | 64217753f55 |
6880931168085 has 48 divisors (see below), whose sum is σ = 12861284003568. Its totient is φ = 3383083699200.
The previous prime is 6880931168021. The next prime is 6880931168159. The reversal of 6880931168085 is 5808611390886.
It can be written as a sum of positive squares in 8 ways, for example, as 4921129963044 + 1959801205041 = 2218362^2 + 1399929^2 .
It is not a de Polignac number, because 6880931168085 - 26 = 6880931168021 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7282986 + ... + 8173355.
It is an arithmetic number, because the mean of its divisors is an integer number (267943416741).
Almost surely, 26880931168085 is an apocalyptic number.
6880931168085 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
6880931168085 is a deficient number, since it is larger than the sum of its proper divisors (5980352835483).
6880931168085 is a wasteful number, since it uses less digits than its factorization.
6880931168085 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15457126 (or 15457123 counting only the distinct ones).
The product of its (nonzero) digits is 19906560, while the sum is 63.
The spelling of 6880931168085 in words is "six trillion, eight hundred eighty billion, nine hundred thirty-one million, one hundred sixty-eight thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •