Base | Representation |
---|---|
bin | 1100010011100010… |
… | …1101010100001101 |
3 | 22112012112221120020 |
4 | 3010320231110031 |
5 | 23231104400023 |
6 | 1303435012353 |
7 | 144566510511 |
oct | 30470552415 |
9 | 8465487506 |
10 | 3303200013 |
11 | 1445630073 |
12 | 78229a0b9 |
13 | 408462a29 |
14 | 2349b0141 |
15 | 144ed5de3 |
hex | c4e2d50d |
3303200013 has 8 divisors (see below), whose sum is σ = 4436415168. Its totient is φ = 2186059104.
The previous prime is 3303200003. The next prime is 3303200041. The reversal of 3303200013 is 3100023033.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3303200013 - 213 = 3303191821 is a prime.
It is a super-2 number, since 2×33032000132 = 21822260651766400338, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3303199965 and 3303200001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3303200003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4018081 + ... + 4018902.
It is an arithmetic number, because the mean of its divisors is an integer number (554551896).
Almost surely, 23303200013 is an apocalyptic number.
It is an amenable number.
3303200013 is a deficient number, since it is larger than the sum of its proper divisors (1133215155).
3303200013 is a wasteful number, since it uses less digits than its factorization.
3303200013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8037123.
The product of its (nonzero) digits is 162, while the sum is 15.
The square root of 3303200013 is about 57473.4722545976. The cubic root of 3303200013 is about 1489.2866295199.
Adding to 3303200013 its reverse (3100023033), we get a palindrome (6403223046).
The spelling of 3303200013 in words is "three billion, three hundred three million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •