Base | Representation |
---|---|
bin | 1011111010100101011100… |
… | …1000111000110000011001 |
3 | 1201101110021000221111101211 |
4 | 2332221113020320300121 |
5 | 3204122034210401332 |
6 | 43510322353543121 |
7 | 2521344526205206 |
oct | 276512710706031 |
9 | 51343230844354 |
10 | 13101112200217 |
11 | 41a1172323328 |
12 | 15770bbb74aa1 |
13 | 740577a2a9a2 |
14 | 334150a7ccad |
15 | 17abcb367447 |
hex | bea57238c19 |
13101112200217 has 2 divisors, whose sum is σ = 13101112200218. Its totient is φ = 13101112200216.
The previous prime is 13101112200193. The next prime is 13101112200257. The reversal of 13101112200217 is 71200221110131.
13101112200217 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8352770493456 + 4748341706761 = 2890116^2 + 2179069^2 .
It is a cyclic number.
It is not a de Polignac number, because 13101112200217 - 231 = 13098964716569 is a prime.
It is not a weakly prime, because it can be changed into another prime (13101112200257) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6550556100108 + 6550556100109.
It is an arithmetic number, because the mean of its divisors is an integer number (6550556100109).
Almost surely, 213101112200217 is an apocalyptic number.
It is an amenable number.
13101112200217 is a deficient number, since it is larger than the sum of its proper divisors (1).
13101112200217 is an equidigital number, since it uses as much as digits as its factorization.
13101112200217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 168, while the sum is 22.
Adding to 13101112200217 its reverse (71200221110131), we get a palindrome (84301333310348).
The spelling of 13101112200217 in words is "thirteen trillion, one hundred one billion, one hundred twelve million, two hundred thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •