Base | Representation |
---|---|
bin | 11101011101011000111… |
… | …10111011000110111101 |
3 | 10120202200201202200112022 |
4 | 32232230132323012331 |
5 | 113041002020232031 |
6 | 2053000420445525 |
7 | 133062351256631 |
oct | 16565436730675 |
9 | 3522621680468 |
10 | 1012211102141 |
11 | 360304862748 |
12 | 14420b5498a5 |
13 | 745b30a3a75 |
14 | 36dc40d6dc1 |
15 | 1b4e37d597b |
hex | ebac7bb1bd |
1012211102141 has 2 divisors, whose sum is σ = 1012211102142. Its totient is φ = 1012211102140.
The previous prime is 1012211102131. The next prime is 1012211102143. The reversal of 1012211102141 is 1412011122101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 637203062500 + 375008039641 = 798250^2 + 612379^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012211102141 - 226 = 1012143993277 is a prime.
It is a Sophie Germain prime.
Together with 1012211102143, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1012211102143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506105551070 + 506105551071.
It is an arithmetic number, because the mean of its divisors is an integer number (506105551071).
Almost surely, 21012211102141 is an apocalyptic number.
It is an amenable number.
1012211102141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012211102141 is an equidigital number, since it uses as much as digits as its factorization.
1012211102141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 1012211102141 its reverse (1412011122101), we get a palindrome (2424222224242).
The spelling of 1012211102141 in words is "one trillion, twelve billion, two hundred eleven million, one hundred two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •