Base | Representation |
---|---|
bin | 10010000000011… |
… | …011001011011101 |
3 | 210001110022221211 |
4 | 102000123023131 |
5 | 1104314214323 |
6 | 45551024421 |
7 | 10325550361 |
oct | 2200331335 |
9 | 701408854 |
10 | 302101213 |
11 | 14558a127 |
12 | 8520b111 |
13 | 4a78531b |
14 | 2c19d2a1 |
15 | 1b7c670d |
hex | 1201b2dd |
302101213 has 2 divisors, whose sum is σ = 302101214. Its totient is φ = 302101212.
The previous prime is 302101211. The next prime is 302101249. The reversal of 302101213 is 312101203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 278656249 + 23444964 = 16693^2 + 4842^2 .
It is a cyclic number.
It is not a de Polignac number, because 302101213 - 21 = 302101211 is a prime.
Together with 302101211, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 302101193 and 302101202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (302101211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 151050606 + 151050607.
It is an arithmetic number, because the mean of its divisors is an integer number (151050607).
Almost surely, 2302101213 is an apocalyptic number.
It is an amenable number.
302101213 is a deficient number, since it is larger than the sum of its proper divisors (1).
302101213 is an equidigital number, since it uses as much as digits as its factorization.
302101213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 302101213 is about 17381.0590298750. The cubic root of 302101213 is about 670.9922277761.
Adding to 302101213 its reverse (312101203), we get a palindrome (614202416).
The spelling of 302101213 in words is "three hundred two million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •