Base | Representation |
---|---|
bin | 10110111111001110110000… |
… | …101101111011100100001001 |
3 | 111020222021110011002102202222 |
4 | 112333032300231323210021 |
5 | 101222424301200323032 |
6 | 555005413130103425 |
7 | 30203251523513132 |
oct | 2677166055734411 |
9 | 436867404072688 |
10 | 101102200011017 |
11 | 2a23a2251a4a97 |
12 | b40a34a27ab75 |
13 | 4454b8695788a |
14 | 1ad753055ac89 |
15 | ba4d78490a12 |
hex | 5bf3b0b7b909 |
101102200011017 has 2 divisors, whose sum is σ = 101102200011018. Its totient is φ = 101102200011016.
The previous prime is 101102200010983. The next prime is 101102200011047. The reversal of 101102200011017 is 710110002201101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 72596040349561 + 28506159661456 = 8520331^2 + 5339116^2 .
It is a cyclic number.
It is not a de Polignac number, because 101102200011017 - 232 = 101097905043721 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101102200010986 and 101102200011004.
It is not a weakly prime, because it can be changed into another prime (101102200011047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50551100005508 + 50551100005509.
It is an arithmetic number, because the mean of its divisors is an integer number (50551100005509).
Almost surely, 2101102200011017 is an apocalyptic number.
It is an amenable number.
101102200011017 is a deficient number, since it is larger than the sum of its proper divisors (1).
101102200011017 is an equidigital number, since it uses as much as digits as its factorization.
101102200011017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 17.
Adding to 101102200011017 its reverse (710110002201101), we get a palindrome (811212202212118).
The spelling of 101102200011017 in words is "one hundred one trillion, one hundred two billion, two hundred million, eleven thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •