Base | Representation |
---|---|
bin | 1100010010110010… |
… | …0010110011001101 |
3 | 22111222112221100112 |
4 | 3010230202303031 |
5 | 23224300324323 |
6 | 1303242405405 |
7 | 144530426642 |
oct | 30454426315 |
9 | 8458487315 |
10 | 3300011213 |
11 | 14438522a4 |
12 | 781200865 |
13 | 4078b7475 |
14 | 2343bddc9 |
15 | 144aa6178 |
hex | c4b22ccd |
3300011213 has 4 divisors (see below), whose sum is σ = 3302305920. Its totient is φ = 3297716508.
The previous prime is 3300011203. The next prime is 3300011261. The reversal of 3300011213 is 3121100033.
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, and also an emirpimes, since its reverse is a distinct semiprime: 3121100033 = 97 ⋅32176289.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3300011213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3300011203) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1145195 + ... + 1148072.
It is an arithmetic number, because the mean of its divisors is an integer number (825576480).
Almost surely, 23300011213 is an apocalyptic number.
It is an amenable number.
3300011213 is a deficient number, since it is larger than the sum of its proper divisors (2294707).
3300011213 is a wasteful number, since it uses less digits than its factorization.
3300011213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2294706.
The product of its (nonzero) digits is 54, while the sum is 14.
The square root of 3300011213 is about 57445.7240619352. The cubic root of 3300011213 is about 1488.8072392122.
Adding to 3300011213 its reverse (3121100033), we get a palindrome (6421111246).
The spelling of 3300011213 in words is "three billion, three hundred million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •