Base | Representation |
---|---|
bin | 100111011011011… |
… | …1000100010100101 |
3 | 10102012110212211021 |
4 | 1032312320202211 |
5 | 10202142311323 |
6 | 335140411141 |
7 | 44533254430 |
oct | 11666704245 |
9 | 3365425737 |
10 | 1323010213 |
11 | 619894178 |
12 | 30b0a6ab1 |
13 | 1811335a5 |
14 | c79d0817 |
15 | 7b23805d |
hex | 4edb88a5 |
1323010213 has 4 divisors (see below), whose sum is σ = 1512011680. Its totient is φ = 1134008748.
The previous prime is 1323010153. The next prime is 1323010231. The reversal of 1323010213 is 3120103231.
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: 3120103231 = 7 ⋅445729033.
It is a cyclic number.
It is not a de Polignac number, because 1323010213 - 217 = 1322879141 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 (1323016213) 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, 94500723 + ... + 94500736.
It is an arithmetic number, because the mean of its divisors is an integer number (378002920).
Almost surely, 21323010213 is an apocalyptic number.
It is an amenable number.
1323010213 is a deficient number, since it is larger than the sum of its proper divisors (189001467).
1323010213 is an equidigital number, since it uses as much as digits as its factorization.
1323010213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 189001466.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 1323010213 is about 36373.2073510159. The cubic root of 1323010213 is about 1097.7945378287.
Adding to 1323010213 its reverse (3120103231), we get a palindrome (4443113444).
The spelling of 1323010213 in words is "one billion, three hundred twenty-three million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •