Base | Representation |
---|---|
bin | 1001010001111001111101… |
… | …1011000100010101110101 |
3 | 1100010102022002021112210122 |
4 | 2110132133123010111311 |
5 | 2314132144313013023 |
6 | 33411143453501325 |
7 | 2102105232013256 |
oct | 224363733042565 |
9 | 40112262245718 |
10 | 10203222001013 |
11 | 3284186905278 |
12 | 11895524a1845 |
13 | 59020cb4a372 |
14 | 273ba50c4b2d |
15 | 12a6211ae2c8 |
hex | 9479f6c4575 |
10203222001013 has 2 divisors, whose sum is σ = 10203222001014. Its totient is φ = 10203222001012.
The previous prime is 10203222000989. The next prime is 10203222001019. The reversal of 10203222001013 is 31010022230201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6983932000369 + 3219290000644 = 2642713^2 + 1794238^2 .
It is a cyclic number.
It is not a de Polignac number, because 10203222001013 - 220 = 10203220952437 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10203222000982 and 10203222001000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10203222001019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5101611000506 + 5101611000507.
It is an arithmetic number, because the mean of its divisors is an integer number (5101611000507).
Almost surely, 210203222001013 is an apocalyptic number.
It is an amenable number.
10203222001013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10203222001013 is an equidigital number, since it uses as much as digits as its factorization.
10203222001013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 10203222001013 its reverse (31010022230201), we get a palindrome (41213244231214).
The spelling of 10203222001013 in words is "ten trillion, two hundred three billion, two hundred twenty-two million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •