Base | Representation |
---|---|
bin | 1111000110001100… |
… | …11000100010111011 |
3 | 202220212010011002210 |
4 | 13203012120202323 |
5 | 113044344144411 |
6 | 3420131430203 |
7 | 404564642664 |
oct | 74306304273 |
9 | 22825104083 |
10 | 8105068731 |
11 | 348a111111 |
12 | 16a2455363 |
13 | 9c223ca76 |
14 | 56c61836b |
15 | 326851ca6 |
hex | 1e31988bb |
8105068731 has 8 divisors (see below), whose sum is σ = 10819028304. Its totient is φ = 5397244160.
The previous prime is 8105068729. The next prime is 8105068759. The reversal of 8105068731 is 1378605018.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 8105068731 - 21 = 8105068729 is a prime.
It is a super-2 number, since 2×81050687312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 8105068731.
It is not an unprimeable number, because it can be changed into a prime (8105068711) 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 7 ways as a sum of consecutive naturals, for example, 1530666 + ... + 1535951.
It is an arithmetic number, because the mean of its divisors is an integer number (1352378538).
Almost surely, 28105068731 is an apocalyptic number.
8105068731 is a deficient number, since it is larger than the sum of its proper divisors (2713959573).
8105068731 is a wasteful number, since it uses less digits than its factorization.
8105068731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3067501.
The product of its (nonzero) digits is 40320, while the sum is 39.
The square root of 8105068731 is about 90028.1552126889. The cubic root of 8105068731 is about 2008.7176734577.
The spelling of 8105068731 in words is "eight billion, one hundred five million, sixty-eight thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •