Base | Representation |
---|---|
bin | 1001010001111010010000… |
… | …1001101010000101101001 |
3 | 1100010102111121112112021012 |
4 | 2110132210021222011221 |
5 | 2314132330114314423 |
6 | 33411155405553305 |
7 | 2102110214154113 |
oct | 224364411520551 |
9 | 40112447475235 |
10 | 10203301323113 |
11 | 3284217663128 |
12 | 1189574b75835 |
13 | 590223401012 |
14 | 273bb18523b3 |
15 | 12a62812c078 |
hex | 947a426a169 |
10203301323113 has 2 divisors, whose sum is σ = 10203301323114. Its totient is φ = 10203301323112.
The previous prime is 10203301323037. The next prime is 10203301323151. The reversal of 10203301323113 is 31132310330201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9779204717584 + 424096605529 = 3127172^2 + 651227^2 .
It is a cyclic number.
It is not a de Polignac number, because 10203301323113 - 28 = 10203301322857 is a prime.
It is not a weakly prime, because it can be changed into another prime (10203301323913) 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, 5101650661556 + 5101650661557.
It is an arithmetic number, because the mean of its divisors is an integer number (5101650661557).
Almost surely, 210203301323113 is an apocalyptic number.
It is an amenable number.
10203301323113 is a deficient number, since it is larger than the sum of its proper divisors (1).
10203301323113 is an equidigital number, since it uses as much as digits as its factorization.
10203301323113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 10203301323113 its reverse (31132310330201), we get a palindrome (41335611653314).
The spelling of 10203301323113 in words is "ten trillion, two hundred three billion, three hundred one million, three hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.197 sec. • engine limits •