Base | Representation |
---|---|
bin | 101111011111111011… |
… | …1101110001110000101 |
3 | 100202021210012200202021 |
4 | 1132333313232032011 |
5 | 3132400321201201 |
6 | 114505404443141 |
7 | 10240510525624 |
oct | 1367767561605 |
9 | 322253180667 |
10 | 102003303301 |
11 | 3a294229569 |
12 | 179288494b1 |
13 | 9807872503 |
14 | 4d191396bb |
15 | 29c0050ea1 |
hex | 17bfdee385 |
102003303301 has 2 divisors, whose sum is σ = 102003303302. Its totient is φ = 102003303300.
The previous prime is 102003303257. The next prime is 102003303317. The reversal of 102003303301 is 103303300201.
It is an a-pointer prime, because the next prime (102003303317) can be obtained adding 102003303301 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 58008240801 + 43995062500 = 240849^2 + 209750^2 .
It is a cyclic number.
It is not a de Polignac number, because 102003303301 - 27 = 102003303173 is a prime.
It is a super-3 number, since 3×1020033033013 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102303303301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51001651650 + 51001651651.
It is an arithmetic number, because the mean of its divisors is an integer number (51001651651).
Almost surely, 2102003303301 is an apocalyptic number.
It is an amenable number.
102003303301 is a deficient number, since it is larger than the sum of its proper divisors (1).
102003303301 is an equidigital number, since it uses as much as digits as its factorization.
102003303301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 16.
Adding to 102003303301 its reverse (103303300201), we get a palindrome (205306603502).
The spelling of 102003303301 in words is "one hundred two billion, three million, three hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •