Base | Representation |
---|---|
bin | 11101001110101001111… |
… | …00110110101010010101 |
3 | 10120000021101211020212221 |
4 | 32213110330312222111 |
5 | 112423301311233133 |
6 | 2045211420342341 |
7 | 132362331006265 |
oct | 16472474665225 |
9 | 3500241736787 |
10 | 1004300102293 |
11 | 357a15253444 |
12 | 1427820a49b1 |
13 | 73922122777 |
14 | 368735997a5 |
15 | 1b1ce01aa2d |
hex | e9d4f36a95 |
1004300102293 has 2 divisors, whose sum is σ = 1004300102294. Its totient is φ = 1004300102292.
The previous prime is 1004300102291. The next prime is 1004300102341. The reversal of 1004300102293 is 3922010034001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 975051577809 + 29248524484 = 987447^2 + 171022^2 .
It is a cyclic number.
It is not a de Polignac number, because 1004300102293 - 21 = 1004300102291 is a prime.
Together with 1004300102291, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1004300102291) 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, 502150051146 + 502150051147.
It is an arithmetic number, because the mean of its divisors is an integer number (502150051147).
Almost surely, 21004300102293 is an apocalyptic number.
It is an amenable number.
1004300102293 is a deficient number, since it is larger than the sum of its proper divisors (1).
1004300102293 is an equidigital number, since it uses as much as digits as its factorization.
1004300102293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 1004300102293 its reverse (3922010034001), we get a palindrome (4926310136294).
The spelling of 1004300102293 in words is "one trillion, four billion, three hundred million, one hundred two thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •