Base | Representation |
---|---|
bin | 10111000000110101001101… |
… | …001110100101111001110101 |
3 | 111021100210101020110220121021 |
4 | 113000311031032211321311 |
5 | 101231230041200014031 |
6 | 555132124235421141 |
7 | 30214224445142605 |
oct | 2700651516457165 |
9 | 437323336426537 |
10 | 101212200001141 |
11 | 2a281942338739 |
12 | b427728bb47b1 |
13 | 4462367150128 |
14 | 1adc9a773ac05 |
15 | ba7b65585511 |
hex | 5c0d4d3a5e75 |
101212200001141 has 2 divisors, whose sum is σ = 101212200001142. Its totient is φ = 101212200001140.
The previous prime is 101212200001139. The next prime is 101212200001169. The reversal of 101212200001141 is 141100002212101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 53580862811025 + 47631337190116 = 7319895^2 + 6901546^2 .
It is a cyclic number.
It is not a de Polignac number, because 101212200001141 - 21 = 101212200001139 is a prime.
Together with 101212200001139, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101212200001441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50606100000570 + 50606100000571.
It is an arithmetic number, because the mean of its divisors is an integer number (50606100000571).
Almost surely, 2101212200001141 is an apocalyptic number.
It is an amenable number.
101212200001141 is a deficient number, since it is larger than the sum of its proper divisors (1).
101212200001141 is an equidigital number, since it uses as much as digits as its factorization.
101212200001141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 101212200001141 its reverse (141100002212101), we get a palindrome (242312202213242).
The spelling of 101212200001141 in words is "one hundred one trillion, two hundred twelve billion, two hundred million, one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •