Base | Representation |
---|---|
bin | 1001001100000110010000… |
… | …0001101001010110100001 |
3 | 1022202212202012011100201202 |
4 | 2103001210001221112201 |
5 | 2311013321423431223 |
6 | 33253242401410545 |
7 | 2061643456333061 |
oct | 223014401512641 |
9 | 38685665140652 |
10 | 10103441233313 |
11 | 32459331a869a |
12 | 1172146039a55 |
13 | 58399a899a9c |
14 | 26d01b2113a1 |
15 | 127c3132c428 |
hex | 930640695a1 |
10103441233313 has 2 divisors, whose sum is σ = 10103441233314. Its totient is φ = 10103441233312.
The previous prime is 10103441233289. The next prime is 10103441233331. The reversal of 10103441233313 is 31333214430101.
Together with next prime (10103441233331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8758474518784 + 1344966714529 = 2959472^2 + 1159727^2 .
It is a cyclic number.
It is not a de Polignac number, because 10103441233313 - 226 = 10103374124449 is a prime.
It is not a weakly prime, because it can be changed into another prime (10103441233013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051720616656 + 5051720616657.
It is an arithmetic number, because the mean of its divisors is an integer number (5051720616657).
Almost surely, 210103441233313 is an apocalyptic number.
It is an amenable number.
10103441233313 is a deficient number, since it is larger than the sum of its proper divisors (1).
10103441233313 is an equidigital number, since it uses as much as digits as its factorization.
10103441233313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 10103441233313 its reverse (31333214430101), we get a palindrome (41436655663414).
The spelling of 10103441233313 in words is "ten trillion, one hundred three billion, four hundred forty-one million, two hundred thirty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •