Base | Representation |
---|---|
bin | 1111110001100010… |
… | …01110011010010001 |
3 | 210212012012111222121 |
4 | 13320301032122101 |
5 | 114320431332240 |
6 | 3520155534241 |
7 | 416601042661 |
oct | 77061163221 |
9 | 23765174877 |
10 | 8468620945 |
11 | 3656352294 |
12 | 178415a381 |
13 | a4c65c615 |
14 | 5a4a121a1 |
15 | 34871604a |
hex | 1f8c4e691 |
8468620945 has 8 divisors (see below), whose sum is σ = 10215000936. Its totient is φ = 6739792896.
The previous prime is 8468620931. The next prime is 8468620981. The reversal of 8468620945 is 5490268648.
It can be written as a sum of positive squares in 4 ways, for example, as 1680344064 + 6788276881 = 40992^2 + 82391^2 .
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 8468620945 - 27 = 8468620817 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 8468620892 and 8468620901.
It is an unprimeable number.
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, 4386922 + ... + 4388851.
It is an arithmetic number, because the mean of its divisors is an integer number (1276875117).
Almost surely, 28468620945 is an apocalyptic number.
It is an amenable number.
8468620945 is a deficient number, since it is larger than the sum of its proper divisors (1746379991).
8468620945 is a wasteful number, since it uses less digits than its factorization.
8468620945 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8775971.
The product of its (nonzero) digits is 3317760, while the sum is 52.
The square root of 8468620945 is about 92025.1104047151. The cubic root of 8468620945 is about 2038.3131115254.
The spelling of 8468620945 in words is "eight billion, four hundred sixty-eight million, six hundred twenty thousand, nine hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •