Base | Representation |
---|---|
bin | 10010000000011… |
… | …011001010010101 |
3 | 210001110022212011 |
4 | 102000123022111 |
5 | 1104314214031 |
6 | 45551024221 |
7 | 10325550226 |
oct | 2200331225 |
9 | 701408764 |
10 | 302101141 |
11 | 14558a071 |
12 | 8520b071 |
13 | 4a785294 |
14 | 2c19d24d |
15 | 1b7c66b1 |
hex | 1201b295 |
302101141 has 2 divisors, whose sum is σ = 302101142. Its totient is φ = 302101140.
The previous prime is 302101139. The next prime is 302101147. The reversal of 302101141 is 141101203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 278189041 + 23912100 = 16679^2 + 4890^2 .
It is an emirp because it is prime and its reverse (141101203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 302101141 - 21 = 302101139 is a prime.
Together with 302101139, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (302101147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 151050570 + 151050571.
It is an arithmetic number, because the mean of its divisors is an integer number (151050571).
Almost surely, 2302101141 is an apocalyptic number.
It is an amenable number.
302101141 is a deficient number, since it is larger than the sum of its proper divisors (1).
302101141 is an equidigital number, since it uses as much as digits as its factorization.
302101141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 302101141 is about 17381.0569586547. The cubic root of 302101141 is about 670.9921744701.
Adding to 302101141 its reverse (141101203), we get a palindrome (443202344).
The spelling of 302101141 in words is "three hundred two million, one hundred one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •