Base | Representation |
---|---|
bin | 101101110001010110001000… |
… | …111101100000111011010011 |
3 | 222101202101112112212010002021 |
4 | 231301112020331200323103 |
5 | 202341122242211221001 |
6 | 1552045213210032311 |
7 | 60254445654621001 |
oct | 5561261075407323 |
9 | 871671475763067 |
10 | 201303120023251 |
11 | 591611a0323154 |
12 | 1a6b1a87718697 |
13 | 8842a588a220c |
14 | 379d1a16d9a71 |
15 | 1841551d65ba1 |
hex | b71588f60ed3 |
201303120023251 has 2 divisors, whose sum is σ = 201303120023252. Its totient is φ = 201303120023250.
The previous prime is 201303120023209. The next prime is 201303120023293. The reversal of 201303120023251 is 152320021303102.
It is a balanced prime because it is at equal distance from previous prime (201303120023209) and next prime (201303120023293).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201303120023251 is a prime.
It is a super-2 number, since 2×2013031200232512 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (201303120021251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100651560011625 + 100651560011626.
It is an arithmetic number, because the mean of its divisors is an integer number (100651560011626).
Almost surely, 2201303120023251 is an apocalyptic number.
201303120023251 is a deficient number, since it is larger than the sum of its proper divisors (1).
201303120023251 is an equidigital number, since it uses as much as digits as its factorization.
201303120023251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 201303120023251 its reverse (152320021303102), we get a palindrome (353623141326353).
The spelling of 201303120023251 in words is "two hundred one trillion, three hundred three billion, one hundred twenty million, twenty-three thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •