Base | Representation |
---|---|
bin | 100000000101101001… |
… | …1100011010111000001 |
3 | 20120212101201121022000 |
4 | 1000023103203113001 |
5 | 2112111220323211 |
6 | 51353442134213 |
7 | 4656430060566 |
oct | 1001323432701 |
9 | 216771647260 |
10 | 68909151681 |
11 | 27251468637 |
12 | 11431651369 |
13 | 666244c386 |
14 | 3499bba86d |
15 | 1bd4986656 |
hex | 100b4e35c1 |
68909151681 has 8 divisors (see below), whose sum is σ = 102087632160. Its totient is φ = 45939434436.
The previous prime is 68909151631. The next prime is 68909151713. The reversal of 68909151681 is 18615190986.
It is not a de Polignac number, because 68909151681 - 29 = 68909151169 is a prime.
It is a super-2 number, since 2×689091516812 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (68909151631) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1276095375 + ... + 1276095428.
It is an arithmetic number, because the mean of its divisors is an integer number (12760954020).
Almost surely, 268909151681 is an apocalyptic number.
It is an amenable number.
68909151681 is a deficient number, since it is larger than the sum of its proper divisors (33178480479).
68909151681 is a wasteful number, since it uses less digits than its factorization.
68909151681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2552190812 (or 2552190806 counting only the distinct ones).
The product of its (nonzero) digits is 933120, while the sum is 54.
The spelling of 68909151681 in words is "sixty-eight billion, nine hundred nine million, one hundred fifty-one thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •