Base | Representation |
---|---|
bin | 1001001100000101000110… |
… | …0111001101010111010001 |
3 | 1022202211221122212120210012 |
4 | 2103001101213031113101 |
5 | 2311012203333004131 |
6 | 33253152004244305 |
7 | 2061633015501635 |
oct | 223012147152721 |
9 | 38684848776705 |
10 | 10103132313041 |
11 | 3245794891289 |
12 | 117207a6a0695 |
13 | 58394b897a21 |
14 | 26cdcc198dc5 |
15 | 127c1415a52b |
hex | 930519cd5d1 |
10103132313041 has 2 divisors, whose sum is σ = 10103132313042. Its totient is φ = 10103132313040.
The previous prime is 10103132312983. The next prime is 10103132313047. The reversal of 10103132313041 is 14031323130101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8299751903041 + 1803380410000 = 2880929^2 + 1342900^2 .
It is a cyclic number.
It is not a de Polignac number, because 10103132313041 - 218 = 10103132050897 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10103132312998 and 10103132313016.
It is not a weakly prime, because it can be changed into another prime (10103132313047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051566156520 + 5051566156521.
It is an arithmetic number, because the mean of its divisors is an integer number (5051566156521).
Almost surely, 210103132313041 is an apocalyptic number.
It is an amenable number.
10103132313041 is a deficient number, since it is larger than the sum of its proper divisors (1).
10103132313041 is an equidigital number, since it uses as much as digits as its factorization.
10103132313041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 10103132313041 its reverse (14031323130101), we get a palindrome (24134455443142).
The spelling of 10103132313041 in words is "ten trillion, one hundred three billion, one hundred thirty-two million, three hundred thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •