Base | Representation |
---|---|
bin | 111101101001101… |
… | …1001000001111111 |
3 | 12100011120212121120 |
4 | 1323103121001333 |
5 | 13214040241311 |
6 | 541135002023 |
7 | 102156332310 |
oct | 17323310177 |
9 | 5304525546 |
10 | 2068680831 |
11 | 971797588 |
12 | 498969313 |
13 | 26c7735c9 |
14 | 158a56607 |
15 | c192c706 |
hex | 7b4d907f |
2068680831 has 8 divisors (see below), whose sum is σ = 3152275584. Its totient is φ = 1182103320.
The previous prime is 2068680799. The next prime is 2068680839. The reversal of 2068680831 is 1380868602.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2068680831 - 25 = 2068680799 is a prime.
It is a super-2 number, since 2×20686808312 = 8558880761093701122, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2068680839) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49254285 + ... + 49254326.
It is an arithmetic number, because the mean of its divisors is an integer number (394034448).
Almost surely, 22068680831 is an apocalyptic number.
2068680831 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2068680831 is a deficient number, since it is larger than the sum of its proper divisors (1083594753).
2068680831 is an equidigital number, since it uses as much as digits as its factorization.
2068680831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98508621.
The product of its (nonzero) digits is 110592, while the sum is 42.
The square root of 2068680831 is about 45482.7531158790. The cubic root of 2068680831 is about 1274.1811132329.
The spelling of 2068680831 in words is "two billion, sixty-eight million, six hundred eighty thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •