Base | Representation |
---|---|
bin | 1011111011001101… |
… | …1000010111110101 |
3 | 22021002111202211122 |
4 | 2332303120113311 |
5 | 23023442441323 |
6 | 1245351313325 |
7 | 142220146205 |
oct | 27663302765 |
9 | 8232452748 |
10 | 3201140213 |
11 | 13a2a62027 |
12 | 75407b845 |
13 | 3c027a80b |
14 | 225204405 |
15 | 13b075ec8 |
hex | becd85f5 |
3201140213 has 4 divisors (see below), whose sum is σ = 3205544160. Its totient is φ = 3196736268.
The previous prime is 3201140177. The next prime is 3201140233. The reversal of 3201140213 is 3120411023.
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 3201140213 - 28 = 3201139957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3201140191 and 3201140200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3201140233) 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, 2200883 + ... + 2202336.
It is an arithmetic number, because the mean of its divisors is an integer number (801386040).
Almost surely, 23201140213 is an apocalyptic number.
It is an amenable number.
3201140213 is a deficient number, since it is larger than the sum of its proper divisors (4403947).
3201140213 is an equidigital number, since it uses as much as digits as its factorization.
3201140213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4403946.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 3201140213 is about 56578.6197516341. The cubic root of 3201140213 is about 1473.7876028642.
Adding to 3201140213 its reverse (3120411023), we get a palindrome (6321551236).
The spelling of 3201140213 in words is "three billion, two hundred one million, one hundred forty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •