Base | Representation |
---|---|
bin | 1000110100111101101… |
… | …00100110100001100101 |
3 | 1001222220100121022022211 |
4 | 10122132310212201211 |
5 | 14432140422101013 |
6 | 351201215123421 |
7 | 30625235004133 |
oct | 4323664464145 |
9 | 1058810538284 |
10 | 303312300133 |
11 | 1076a7982427 |
12 | 4a94a813571 |
13 | 227aa12970b |
14 | 10975000753 |
15 | 7d5339123d |
hex | 469ed26865 |
303312300133 has 2 divisors, whose sum is σ = 303312300134. Its totient is φ = 303312300132.
The previous prime is 303312300131. The next prime is 303312300173. The reversal of 303312300133 is 331003213303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 172024198564 + 131288101569 = 414758^2 + 362337^2 .
It is a cyclic number.
It is not a de Polignac number, because 303312300133 - 21 = 303312300131 is a prime.
Together with 303312300131, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (303312300131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 151656150066 + 151656150067.
It is an arithmetic number, because the mean of its divisors is an integer number (151656150067).
Almost surely, 2303312300133 is an apocalyptic number.
It is an amenable number.
303312300133 is a deficient number, since it is larger than the sum of its proper divisors (1).
303312300133 is an equidigital number, since it uses as much as digits as its factorization.
303312300133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 22.
Adding to 303312300133 its reverse (331003213303), we get a palindrome (634315513436).
The spelling of 303312300133 in words is "three hundred three billion, three hundred twelve million, three hundred thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.238 sec. • engine limits •