Base | Representation |
---|---|
bin | 101111111110010001… |
… | …0000000010010001101 |
3 | 100211220201020002000111 |
4 | 1133330202000102031 |
5 | 3141441340122201 |
6 | 115154402000021 |
7 | 10304646136603 |
oct | 1377442002215 |
9 | 324821202014 |
10 | 103021020301 |
11 | 3a7667533a1 |
12 | 17b71646011 |
13 | 993a673914 |
14 | 4db4379873 |
15 | 2a2e581b51 |
hex | 17fc88048d |
103021020301 has 2 divisors, whose sum is σ = 103021020302. Its totient is φ = 103021020300.
The previous prime is 103021020293. The next prime is 103021020307. The reversal of 103021020301 is 103020120301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 84840543076 + 18180477225 = 291274^2 + 134835^2 .
It is a cyclic number.
It is not a de Polignac number, because 103021020301 - 23 = 103021020293 is a prime.
It is a super-2 number, since 2×1030210203012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103021020307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51510510150 + 51510510151.
It is an arithmetic number, because the mean of its divisors is an integer number (51510510151).
Almost surely, 2103021020301 is an apocalyptic number.
It is an amenable number.
103021020301 is a deficient number, since it is larger than the sum of its proper divisors (1).
103021020301 is an equidigital number, since it uses as much as digits as its factorization.
103021020301 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.
Adding to 103021020301 its reverse (103020120301), we get a palindrome (206041140602).
The spelling of 103021020301 in words is "one hundred three billion, twenty-one million, twenty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •