Base | Representation |
---|---|
bin | 10111001100010101001001… |
… | …000001000011000110101001 |
3 | 111101011100000212102220102222 |
4 | 113030111021001003012221 |
5 | 101332201410222334304 |
6 | 1000535131315203425 |
7 | 30325300433440634 |
oct | 2714251101030651 |
9 | 441140025386388 |
10 | 102002403324329 |
11 | 2a556a81530112 |
12 | b5348ba5a6575 |
13 | 44bba2958b101 |
14 | 1b28d2a948c1b |
15 | bbd4b377d4be |
hex | 5cc5490431a9 |
102002403324329 has 2 divisors, whose sum is σ = 102002403324330. Its totient is φ = 102002403324328.
The previous prime is 102002403324301. The next prime is 102002403324463. The reversal of 102002403324329 is 923423304200201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 69625757082025 + 32376646242304 = 8344205^2 + 5690048^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102002403324329 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (102002403324529) 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, 51001201662164 + 51001201662165.
It is an arithmetic number, because the mean of its divisors is an integer number (51001201662165).
Almost surely, 2102002403324329 is an apocalyptic number.
It is an amenable number.
102002403324329 is a deficient number, since it is larger than the sum of its proper divisors (1).
102002403324329 is an equidigital number, since it uses as much as digits as its factorization.
102002403324329 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 62208, while the sum is 35.
The spelling of 102002403324329 in words is "one hundred two trillion, two billion, four hundred three million, three hundred twenty-four thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •