Base | Representation |
---|---|
bin | 1011111110000100… |
… | …0101001011001011 |
3 | 22021221001102021222 |
4 | 2333201011023023 |
5 | 23040024321303 |
6 | 1250500152255 |
7 | 142424033246 |
oct | 27741051313 |
9 | 8257042258 |
10 | 3213120203 |
11 | 13a97a4847 |
12 | 75809868b |
13 | 3c28b3677 |
14 | 226a4225d |
15 | 13c140938 |
hex | bf8452cb |
3213120203 has 8 divisors (see below), whose sum is σ = 3249256560. Its totient is φ = 3177105120.
The previous prime is 3213120143. The next prime is 3213120257. The reversal of 3213120203 is 3020213123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3213120203 - 218 = 3212858059 is a prime.
It is a super-2 number, since 2×32131202032 = 20648282877853522418, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3213120403) 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 7 ways as a sum of consecutive naturals, for example, 23501 + ... + 83537.
It is an arithmetic number, because the mean of its divisors is an integer number (406157070).
Almost surely, 23213120203 is an apocalyptic number.
3213120203 is a deficient number, since it is larger than the sum of its proper divisors (36136357).
3213120203 is a wasteful number, since it uses less digits than its factorization.
3213120203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60637.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 3213120203 is about 56684.3911760548. The cubic root of 3213120203 is about 1475.6238216227.
Adding to 3213120203 its reverse (3020213123), we get a palindrome (6233333326).
The spelling of 3213120203 in words is "three billion, two hundred thirteen million, one hundred twenty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •