Base | Representation |
---|---|
bin | 1100010010110101… |
… | …0110000100011101 |
3 | 22111222221121102022 |
4 | 3010231112010131 |
5 | 23224324034323 |
6 | 1303251105525 |
7 | 144532263122 |
oct | 30455260435 |
9 | 8458847368 |
10 | 3300221213 |
11 | 1443986053 |
12 | 7812a22a5 |
13 | 40795bc23 |
14 | 234436749 |
15 | 144ae84c8 |
hex | c4b5611d |
3300221213 has 4 divisors (see below), whose sum is σ = 3301193280. Its totient is φ = 3299249148.
The previous prime is 3300221209. The next prime is 3300221251. The reversal of 3300221213 is 3121220033.
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 a cyclic number.
It is not a de Polignac number, because 3300221213 - 22 = 3300221209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3300221191 and 3300221200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3300227213) 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, 480923 + ... + 487736.
It is an arithmetic number, because the mean of its divisors is an integer number (825298320).
Almost surely, 23300221213 is an apocalyptic number.
It is an amenable number.
3300221213 is a deficient number, since it is larger than the sum of its proper divisors (972067).
3300221213 is an equidigital number, since it uses as much as digits as its factorization.
3300221213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 972066.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 3300221213 is about 57447.5518451396. The cubic root of 3300221213 is about 1488.8388191946.
Adding to 3300221213 its reverse (3121220033), we get a palindrome (6421441246).
The spelling of 3300221213 in words is "three billion, three hundred million, two hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •