Base | Representation |
---|---|
bin | 1111100000011111… |
… | …11011111100000001 |
3 | 210111020020012111001 |
4 | 13300033323330001 |
5 | 114022333124201 |
6 | 3454052052001 |
7 | 413214041131 |
oct | 76017737401 |
9 | 23436205431 |
10 | 8325676801 |
11 | 359269a232 |
12 | 1744304001 |
13 | a28b611a0 |
14 | 58da42ac1 |
15 | 33adcc301 |
hex | 1f03fbf01 |
8325676801 has 4 divisors (see below), whose sum is σ = 8966113492. Its totient is φ = 7685240112.
The previous prime is 8325676771. The next prime is 8325676817. The reversal of 8325676801 is 1086765238.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 816587776 + 7509089025 = 28576^2 + 86655^2 .
It is a cyclic number.
It is not a de Polignac number, because 8325676801 - 25 = 8325676769 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (8325676201) 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 3 ways as a sum of consecutive naturals, for example, 320218326 + ... + 320218351.
It is an arithmetic number, because the mean of its divisors is an integer number (2241528373).
Almost surely, 28325676801 is an apocalyptic number.
It is an amenable number.
8325676801 is a deficient number, since it is larger than the sum of its proper divisors (640436691).
8325676801 is a wasteful number, since it uses less digits than its factorization.
8325676801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 640436690.
The product of its (nonzero) digits is 483840, while the sum is 46.
The square root of 8325676801 is about 91245.1467257300. The cubic root of 8325676801 is about 2026.7795605822.
The spelling of 8325676801 in words is "eight billion, three hundred twenty-five million, six hundred seventy-six thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •