Base | Representation |
---|---|
bin | 10110111111001101101010… |
… | …011001010110101111000001 |
3 | 111020222011101221002110000001 |
4 | 112333031222121112233001 |
5 | 101222414342133242121 |
6 | 555005100103000001 |
7 | 30203210346422254 |
oct | 2677155231265701 |
9 | 436864357073001 |
10 | 101101020212161 |
11 | 2a23977a236712 |
12 | b40a07b139001 |
13 | 4454a293b7248 |
14 | 1ad745b9a909b |
15 | ba4d09ae5991 |
hex | 5bf36a656bc1 |
101101020212161 has 2 divisors, whose sum is σ = 101101020212162. Its totient is φ = 101101020212160.
The previous prime is 101101020212083. The next prime is 101101020212177. The reversal of 101101020212161 is 161212020101101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86226545930625 + 14874474281536 = 9285825^2 + 3856744^2 .
It is an emirp because it is prime and its reverse (161212020101101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101101020212161 - 29 = 101101020211649 is a prime.
It is not a weakly prime, because it can be changed into another prime (101101020212191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550510106080 + 50550510106081.
It is an arithmetic number, because the mean of its divisors is an integer number (50550510106081).
Almost surely, 2101101020212161 is an apocalyptic number.
It is an amenable number.
101101020212161 is a deficient number, since it is larger than the sum of its proper divisors (1).
101101020212161 is an equidigital number, since it uses as much as digits as its factorization.
101101020212161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 101101020212161 its reverse (161212020101101), we get a palindrome (262313040313262).
The spelling of 101101020212161 in words is "one hundred one trillion, one hundred one billion, twenty million, two hundred twelve thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •