Base | Representation |
---|---|
bin | 1001010001111010010101… |
… | …0001010110000001011101 |
3 | 1100010102112220220021021212 |
4 | 2110132211101112001131 |
5 | 2314132344422142133 |
6 | 33411201320434205 |
7 | 2102110532662604 |
oct | 224364521260135 |
9 | 40112486807255 |
10 | 10203320115293 |
11 | 3284227228a58 |
12 | 118957b318965 |
13 | 590227280756 |
14 | 273bb4144a3b |
15 | 12a629ae0148 |
hex | 947a545605d |
10203320115293 has 2 divisors, whose sum is σ = 10203320115294. Its totient is φ = 10203320115292.
The previous prime is 10203320115193. The next prime is 10203320115311. The reversal of 10203320115293 is 39251102330201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9444423019684 + 758897095609 = 3073178^2 + 871147^2 .
It is an emirp because it is prime and its reverse (39251102330201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10203320115293 - 212 = 10203320111197 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10203320115193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5101660057646 + 5101660057647.
It is an arithmetic number, because the mean of its divisors is an integer number (5101660057647).
Almost surely, 210203320115293 is an apocalyptic number.
It is an amenable number.
10203320115293 is a deficient number, since it is larger than the sum of its proper divisors (1).
10203320115293 is an equidigital number, since it uses as much as digits as its factorization.
10203320115293 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9720, while the sum is 32.
Adding to 10203320115293 its reverse (39251102330201), we get a palindrome (49454422445494).
The spelling of 10203320115293 in words is "ten trillion, two hundred three billion, three hundred twenty million, one hundred fifteen thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •