Base | Representation |
---|---|
bin | 110000100110101000011… |
… | …0000101010110111100011 |
3 | 212122121022201020011002200 |
4 | 1201031100300222313203 |
5 | 1333421144421043214 |
6 | 22112432450144243 |
7 | 1256421230221215 |
oct | 141152060526743 |
9 | 25577281204080 |
10 | 6680029081059 |
11 | 2145a912a5064 |
12 | 8ba774282083 |
13 | 395c02164a29 |
14 | 19145aa1c5b5 |
15 | b8b69b1ad09 |
hex | 61350c2ade3 |
6680029081059 has 12 divisors (see below), whose sum is σ = 9873324637176. Its totient is φ = 4349786378112.
The previous prime is 6680029081051. The next prime is 6680029081079. The reversal of 6680029081059 is 9501809200866.
It is a happy number.
It is not a de Polignac number, because 6680029081059 - 23 = 6680029081051 is a prime.
It is a super-2 number, since 2×66800290810592 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 6680029080996 and 6680029081014.
It is not an unprimeable number, because it can be changed into a prime (6680029081051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8630528142 + ... + 8630528915.
It is an arithmetic number, because the mean of its divisors is an integer number (822777053098).
Almost surely, 26680029081059 is an apocalyptic number.
6680029081059 is a deficient number, since it is larger than the sum of its proper divisors (3193295556117).
6680029081059 is a wasteful number, since it uses less digits than its factorization.
6680029081059 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17261057106 (or 17261057103 counting only the distinct ones).
The product of its (nonzero) digits is 1866240, while the sum is 54.
The spelling of 6680029081059 in words is "six trillion, six hundred eighty billion, twenty-nine million, eighty-one thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •