Base | Representation |
---|---|
bin | 11101011011010111000… |
… | …01010001111101101001 |
3 | 10120122212202220222020102 |
4 | 32231223201101331221 |
5 | 113031234011413001 |
6 | 2052300324235145 |
7 | 133023345254402 |
oct | 16555341217551 |
9 | 3518782828212 |
10 | 1011121201001 |
11 | 35a8a56158aa |
12 | 143b6653bab5 |
13 | 7446b34a952 |
14 | 36d1d4669a9 |
15 | 1b47cc96e6b |
hex | eb6b851f69 |
1011121201001 has 2 divisors, whose sum is σ = 1011121201002. Its totient is φ = 1011121201000.
The previous prime is 1011121200983. The next prime is 1011121201031. The reversal of 1011121201001 is 1001021211101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 989873765776 + 21247435225 = 994924^2 + 145765^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011121201001 - 226 = 1011054092137 is a prime.
It is a super-2 number, since 2×10111212010012 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1011121201031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505560600500 + 505560600501.
It is an arithmetic number, because the mean of its divisors is an integer number (505560600501).
Almost surely, 21011121201001 is an apocalyptic number.
It is an amenable number.
1011121201001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011121201001 is an equidigital number, since it uses as much as digits as its factorization.
1011121201001 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 1011121201001 its reverse (1001021211101), we get a palindrome (2012142412102).
The spelling of 1011121201001 in words is "one trillion, eleven billion, one hundred twenty-one million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •