Base | Representation |
---|---|
bin | 11101011011001010000… |
… | …01001011000110101001 |
3 | 10120122121011200010121102 |
4 | 32231211001023012221 |
5 | 113031023100333001 |
6 | 2052241430251145 |
7 | 133020552144041 |
oct | 16554501130651 |
9 | 3518534603542 |
10 | 1011012121001 |
11 | 35a849a92443 |
12 | 143b35ab6ab5 |
13 | 7445187827c |
14 | 36d0cb90721 |
15 | 1b4733ebe6b |
hex | eb6504b1a9 |
1011012121001 has 2 divisors, whose sum is σ = 1011012121002. Its totient is φ = 1011012121000.
The previous prime is 1011012120973. The next prime is 1011012121039. The reversal of 1011012121001 is 1001212101101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 674124744601 + 336887376400 = 821051^2 + 580420^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1011012121001 is a prime.
It is not a weakly prime, because it can be changed into another prime (1011012121601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505506060500 + 505506060501.
It is an arithmetic number, because the mean of its divisors is an integer number (505506060501).
Almost surely, 21011012121001 is an apocalyptic number.
It is an amenable number.
1011012121001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011012121001 is an equidigital number, since it uses as much as digits as its factorization.
1011012121001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1011012121001 its reverse (1001212101101), we get a palindrome (2012224222102).
It can be divided in two parts, 10 and 11012121001, that added together give a palindrome (11012121011).
The spelling of 1011012121001 in words is "one trillion, eleven billion, twelve million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •