Base | Representation |
---|---|
bin | 1000110101001000001… |
… | …11111001001001001101 |
3 | 1002000010112222002021222 |
4 | 10122210013321021031 |
5 | 14432331204240323 |
6 | 351214113333125 |
7 | 30630365005325 |
oct | 4324407711115 |
9 | 1060115862258 |
10 | 303401243213 |
11 | 107743101702 |
12 | 4a9745671a5 |
13 | 227c269b563 |
14 | 10982b54285 |
15 | 7d5b0ae9c8 |
hex | 46a41f924d |
303401243213 has 2 divisors, whose sum is σ = 303401243214. Its totient is φ = 303401243212.
The previous prime is 303401243203. The next prime is 303401243239. The reversal of 303401243213 is 312342104303.
It is an a-pointer prime, because the next prime (303401243239) can be obtained adding 303401243213 to its sum of digits (26).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 292364059849 + 11037183364 = 540707^2 + 105058^2 .
It is a cyclic number.
It is not a de Polignac number, because 303401243213 - 234 = 286221374029 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (303401243203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 151700621606 + 151700621607.
It is an arithmetic number, because the mean of its divisors is an integer number (151700621607).
Almost surely, 2303401243213 is an apocalyptic number.
It is an amenable number.
303401243213 is a deficient number, since it is larger than the sum of its proper divisors (1).
303401243213 is an equidigital number, since it uses as much as digits as its factorization.
303401243213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 303401243213 its reverse (312342104303), we get a palindrome (615743347516).
The spelling of 303401243213 in words is "three hundred three billion, four hundred one million, two hundred forty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •