Base | Representation |
---|---|
bin | 1111010110100100… |
… | …00001101110111011 |
3 | 210021102102012011110 |
4 | 13223102001232323 |
5 | 113340014314442 |
6 | 3441513531403 |
7 | 411152503056 |
oct | 75322015673 |
9 | 23242365143 |
10 | 8242338747 |
11 | 354a649105 |
12 | 1720413b63 |
13 | a14802626 |
14 | 58294ba9d |
15 | 33391969c |
hex | 1eb481bbb |
8242338747 has 8 divisors (see below), whose sum is σ = 11035768320. Its totient is φ = 5471900840.
The previous prime is 8242338661. The next prime is 8242338829. The reversal of 8242338747 is 7478332428.
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 8242338747 - 210 = 8242337723 is a prime.
It is a super-2 number, since 2×82423387472 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 8242338696 and 8242338705.
It is not an unprimeable number, because it can be changed into a prime (8242338547) 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, 5747079 + ... + 5748512.
It is an arithmetic number, because the mean of its divisors is an integer number (1379471040).
Almost surely, 28242338747 is an apocalyptic number.
8242338747 is a deficient number, since it is larger than the sum of its proper divisors (2793429573).
8242338747 is a wasteful number, since it uses less digits than its factorization.
8242338747 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11495833.
The product of its digits is 1806336, while the sum is 48.
The square root of 8242338747 is about 90787.3270175965. The cubic root of 8242338747 is about 2019.9943426140.
The spelling of 8242338747 in words is "eight billion, two hundred forty-two million, three hundred thirty-eight thousand, seven hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •