Base | Representation |
---|---|
bin | 1001000110010000100001… |
… | …1011010010011000100101 |
3 | 1022102021210122110000002121 |
4 | 2101210020123102120211 |
5 | 2302342342233001201 |
6 | 33135211525505541 |
7 | 2051462433546031 |
oct | 221441033223045 |
9 | 38367718400077 |
10 | 10003120203301 |
11 | 3207332634a35 |
12 | 11568088722b1 |
13 | 5773a0708374 |
14 | 2682216a51c1 |
15 | 12530dd2c9a1 |
hex | 919086d2625 |
10003120203301 has 2 divisors, whose sum is σ = 10003120203302. Its totient is φ = 10003120203300.
The previous prime is 10003120203259. The next prime is 10003120203341. The reversal of 10003120203301 is 10330202130001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5990750655201 + 4012369548100 = 2447601^2 + 2003090^2 .
It is a cyclic number.
It is not a de Polignac number, because 10003120203301 - 235 = 9968760464933 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10003120203341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5001560101650 + 5001560101651.
It is an arithmetic number, because the mean of its divisors is an integer number (5001560101651).
Almost surely, 210003120203301 is an apocalyptic number.
It is an amenable number.
10003120203301 is a deficient number, since it is larger than the sum of its proper divisors (1).
10003120203301 is an equidigital number, since it uses as much as digits as its factorization.
10003120203301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 10003120203301 its reverse (10330202130001), we get a palindrome (20333322333302).
The spelling of 10003120203301 in words is "ten trillion, three billion, one hundred twenty million, two hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •