Base | Representation |
---|---|
bin | 11101011101001011110… |
… | …11100001110010111001 |
3 | 10120202102001220001102122 |
4 | 32232211323201302321 |
5 | 113040240344110441 |
6 | 2052541452211025 |
7 | 133056544626152 |
oct | 16564573416271 |
9 | 3522361801378 |
10 | 1012101160121 |
11 | 3602587a0677 |
12 | 14419a769a75 |
13 | 7459638bc0c |
14 | 36db3678929 |
15 | 1b4d8d1a34b |
hex | eba5ee1cb9 |
1012101160121 has 2 divisors, whose sum is σ = 1012101160122. Its totient is φ = 1012101160120.
The previous prime is 1012101160111. The next prime is 1012101160237. The reversal of 1012101160121 is 1210611012101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 680856019600 + 331245140521 = 825140^2 + 575539^2 .
It is an emirp because it is prime and its reverse (1210611012101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1012101160121 - 214 = 1012101143737 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1012101160121.
It is not a weakly prime, because it can be changed into another prime (1012101160111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506050580060 + 506050580061.
It is an arithmetic number, because the mean of its divisors is an integer number (506050580061).
Almost surely, 21012101160121 is an apocalyptic number.
It is an amenable number.
1012101160121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012101160121 is an equidigital number, since it uses as much as digits as its factorization.
1012101160121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 1012101160121 its reverse (1210611012101), we get a palindrome (2222712172222).
The spelling of 1012101160121 in words is "one trillion, twelve billion, one hundred one million, one hundred sixty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •