Base | Representation |
---|---|
bin | 10111001100011100011011… |
… | …000000010101100001101111 |
3 | 111101012002012201101020202102 |
4 | 113030130123000111201233 |
5 | 101332313413124222203 |
6 | 1000542503154045315 |
7 | 30325665244345052 |
oct | 2714343300254157 |
9 | 441162181336672 |
10 | 102010221320303 |
11 | 2a55a32359720a |
12 | b53632087983b |
13 | 44bc6a41a812a |
14 | 1b2946cd96a99 |
15 | bbd7becc6888 |
hex | 5cc71b01586f |
102010221320303 has 2 divisors, whose sum is σ = 102010221320304. Its totient is φ = 102010221320302.
The previous prime is 102010221320269. The next prime is 102010221320339. The reversal of 102010221320303 is 303023122010201.
It is a weak prime.
It is an emirp because it is prime and its reverse (303023122010201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102010221320303 - 220 = 102010220271727 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102010221320353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51005110660151 + 51005110660152.
It is an arithmetic number, because the mean of its divisors is an integer number (51005110660152).
Almost surely, 2102010221320303 is an apocalyptic number.
102010221320303 is a deficient number, since it is larger than the sum of its proper divisors (1).
102010221320303 is an equidigital number, since it uses as much as digits as its factorization.
102010221320303 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 102010221320303 its reverse (303023122010201), we get a palindrome (405033343330504).
The spelling of 102010221320303 in words is "one hundred two trillion, ten billion, two hundred twenty-one million, three hundred twenty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •