Base | Representation |
---|---|
bin | 1111011011001001… |
… | …10001010011001001 |
3 | 210101002210120010210 |
4 | 13231210301103021 |
5 | 113424341302401 |
6 | 3445410231333 |
7 | 412130460204 |
oct | 75544612311 |
9 | 23332716123 |
10 | 8280806601 |
11 | 356a332621 |
12 | 1731285549 |
13 | a1c780982 |
14 | 587ac293b |
15 | 336eb74d6 |
hex | 1ed9314c9 |
8280806601 has 4 divisors (see below), whose sum is σ = 11041075472. Its totient is φ = 5520537732.
The previous prime is 8280806593. The next prime is 8280806603. The reversal of 8280806601 is 1066080828.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 8280806601 - 23 = 8280806593 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 8280806601.
It is not an unprimeable number, because it can be changed into a prime (8280806603) 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 3 ways as a sum of consecutive naturals, for example, 1380134431 + ... + 1380134436.
It is an arithmetic number, because the mean of its divisors is an integer number (2760268868).
Almost surely, 28280806601 is an apocalyptic number.
It is an amenable number.
8280806601 is a deficient number, since it is larger than the sum of its proper divisors (2760268871).
8280806601 is a wasteful number, since it uses less digits than its factorization.
8280806601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2760268870.
The product of its (nonzero) digits is 36864, while the sum is 39.
The square root of 8280806601 is about 90998.9373619275. The cubic root of 8280806601 is about 2023.1319744908.
The spelling of 8280806601 in words is "eight billion, two hundred eighty million, eight hundred six thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •