Base | Representation |
---|---|
bin | 101100001010000100001… |
… | …0101001101100000001111 |
3 | 210111011222001210120102122 |
4 | 1120110020111031200033 |
5 | 1243413131203123221 |
6 | 20524005521243155 |
7 | 1164315464445311 |
oct | 130241025154017 |
9 | 23434861716378 |
10 | 6068928567311 |
11 | 1a2a8aaa61265 |
12 | 820247a934bb |
13 | 3503b38195bc |
14 | 16da483c17b1 |
15 | a7d004a6eab |
hex | 5850854d80f |
6068928567311 has 32 divisors (see below), whose sum is σ = 6277869619200. Its totient is φ = 5864606167680.
The previous prime is 6068928567287. The next prime is 6068928567391. The reversal of 6068928567311 is 1137658298606.
It is a cyclic number.
It is not a de Polignac number, because 6068928567311 - 226 = 6068861458447 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6068928567391) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 509602625 + ... + 509614533.
It is an arithmetic number, because the mean of its divisors is an integer number (196183425600).
Almost surely, 26068928567311 is an apocalyptic number.
6068928567311 is a gapful number since it is divisible by the number (61) formed by its first and last digit.
6068928567311 is a deficient number, since it is larger than the sum of its proper divisors (208941051889).
6068928567311 is a wasteful number, since it uses less digits than its factorization.
6068928567311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12719.
The product of its (nonzero) digits is 26127360, while the sum is 62.
The spelling of 6068928567311 in words is "six trillion, sixty-eight billion, nine hundred twenty-eight million, five hundred sixty-seven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •