Base | Representation |
---|---|
bin | 1001010001110011001110… |
… | …0111100100111110111001 |
3 | 1100010020122000222002211221 |
4 | 2110130303213210332321 |
5 | 2314114443303403423 |
6 | 33410244203552041 |
7 | 2102012350450321 |
oct | 224346347447671 |
9 | 40106560862757 |
10 | 10201413341113 |
11 | 3283438976325 |
12 | 118912882b621 |
13 | 58ccb22176c7 |
14 | 273a72bd6281 |
15 | 12a5674e4e5d |
hex | 947339e4fb9 |
10201413341113 has 2 divisors, whose sum is σ = 10201413341114. Its totient is φ = 10201413341112.
The previous prime is 10201413340969. The next prime is 10201413341143. The reversal of 10201413341113 is 31114331410201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6241842663424 + 3959570677689 = 2498368^2 + 1989867^2 .
It is a cyclic number.
It is not a de Polignac number, because 10201413341113 - 237 = 10063974387641 is a prime.
It is not a weakly prime, because it can be changed into another prime (10201413341143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100706670556 + 5100706670557.
It is an arithmetic number, because the mean of its divisors is an integer number (5100706670557).
Almost surely, 210201413341113 is an apocalyptic number.
It is an amenable number.
10201413341113 is a deficient number, since it is larger than the sum of its proper divisors (1).
10201413341113 is an equidigital number, since it uses as much as digits as its factorization.
10201413341113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 10201413341113 its reverse (31114331410201), we get a palindrome (41315744751314).
The spelling of 10201413341113 in words is "ten trillion, two hundred one billion, four hundred thirteen million, three hundred forty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •