Base | Representation |
---|---|
bin | 1100010000000111… |
… | …1000010010000101 |
3 | 22111012111201111220 |
4 | 3010001320102011 |
5 | 23213414431023 |
6 | 1302202550553 |
7 | 144333365643 |
oct | 30401702205 |
9 | 8435451456 |
10 | 3288827013 |
11 | 143850345a |
12 | 779508459 |
13 | 40549c8b4 |
14 | 232b0c193 |
15 | 143ae73e3 |
hex | c4078485 |
3288827013 has 8 divisors (see below), whose sum is σ = 4492056576. Its totient is φ = 2139074400.
The previous prime is 3288827011. The next prime is 3288827023. The reversal of 3288827013 is 3107288823.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3288827013 - 21 = 3288827011 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3288827011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13369093 + ... + 13369338.
It is an arithmetic number, because the mean of its divisors is an integer number (561507072).
Almost surely, 23288827013 is an apocalyptic number.
It is an amenable number.
3288827013 is a deficient number, since it is larger than the sum of its proper divisors (1203229563).
3288827013 is a wasteful number, since it uses less digits than its factorization.
3288827013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26738475.
The product of its (nonzero) digits is 129024, while the sum is 42.
The square root of 3288827013 is about 57348.2956416318. The cubic root of 3288827013 is about 1487.1234101444.
The spelling of 3288827013 in words is "three billion, two hundred eighty-eight million, eight hundred twenty-seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •