Base | Representation |
---|---|
bin | 1001010001101110000010… |
… | …0101100011110110111101 |
3 | 1100010010000221201110012121 |
4 | 2110123200211203312331 |
5 | 2314104120144201133 |
6 | 33405454042202541 |
7 | 2101633004022502 |
oct | 224334045436675 |
9 | 40103027643177 |
10 | 10200020303293 |
11 | 32828936023a7 |
12 | 11889ba1b3451 |
13 | 58cb1c735b82 |
14 | 27397dbb74a9 |
15 | 12a4d507802d |
hex | 946e0963dbd |
10200020303293 has 2 divisors, whose sum is σ = 10200020303294. Its totient is φ = 10200020303292.
The previous prime is 10200020303269. The next prime is 10200020303311. The reversal of 10200020303293 is 39230302000201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7818807141369 + 2381213161924 = 2796213^2 + 1543118^2 .
It is a cyclic number.
It is not a de Polignac number, because 10200020303293 - 25 = 10200020303261 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10200020303203) 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, 5100010151646 + 5100010151647.
It is an arithmetic number, because the mean of its divisors is an integer number (5100010151647).
Almost surely, 210200020303293 is an apocalyptic number.
It is an amenable number.
10200020303293 is a deficient number, since it is larger than the sum of its proper divisors (1).
10200020303293 is an equidigital number, since it uses as much as digits as its factorization.
10200020303293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 10200020303293 its reverse (39230302000201), we get a palindrome (49430322303494).
The spelling of 10200020303293 in words is "ten trillion, two hundred billion, twenty million, three hundred three thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •