Base | Representation |
---|---|
bin | 1001011101100010100111… |
… | …0111111111000110000001 |
3 | 1100211112020212002022222022 |
4 | 2113120221313333012001 |
5 | 2330421034003124441 |
6 | 34043042502451225 |
7 | 2122412563214255 |
oct | 227305167770601 |
9 | 40745225068868 |
10 | 10403113333121 |
11 | 3350a322a46a3 |
12 | 1200239733b15 |
13 | 5a60177ac5c2 |
14 | 27d72899a265 |
15 | 13091ed1a84b |
hex | 97629dff181 |
10403113333121 has 2 divisors, whose sum is σ = 10403113333122. Its totient is φ = 10403113333120.
The previous prime is 10403113333097. The next prime is 10403113333153. The reversal of 10403113333121 is 12133331130401.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9601873518721 + 801239814400 = 3098689^2 + 895120^2 .
It is a cyclic number.
It is not a de Polignac number, because 10403113333121 - 210 = 10403113332097 is a prime.
It is a super-3 number, since 3×104031133331213 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (10403113333321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5201556666560 + 5201556666561.
It is an arithmetic number, because the mean of its divisors is an integer number (5201556666561).
Almost surely, 210403113333121 is an apocalyptic number.
It is an amenable number.
10403113333121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10403113333121 is an equidigital number, since it uses as much as digits as its factorization.
10403113333121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 10403113333121 its reverse (12133331130401), we get a palindrome (22536444463522).
The spelling of 10403113333121 in words is "ten trillion, four hundred three billion, one hundred thirteen million, three hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •