Base | Representation |
---|---|
bin | 11101011001101010101… |
… | …00111101100100110101 |
3 | 10120120112102002212211002 |
4 | 32230311110331210311 |
5 | 113022403233031401 |
6 | 2052030205053045 |
7 | 132661665223631 |
oct | 16546524754465 |
9 | 3516472085732 |
10 | 1010212002101 |
11 | 35a479380255 |
12 | 143951b57185 |
13 | 74354b83233 |
14 | 36c747d3dc1 |
15 | 1b42804ea6b |
hex | eb3553d935 |
1010212002101 has 2 divisors, whose sum is σ = 1010212002102. Its totient is φ = 1010212002100.
The previous prime is 1010212002091. The next prime is 1010212002113. The reversal of 1010212002101 is 1012002120101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 776159238001 + 234052764100 = 880999^2 + 483790^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010212002101 - 210 = 1010212001077 is a prime.
It is a super-3 number, since 3×10102120021013 (a number of 37 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010212002181) 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, 505106001050 + 505106001051.
It is an arithmetic number, because the mean of its divisors is an integer number (505106001051).
Almost surely, 21010212002101 is an apocalyptic number.
It is an amenable number.
1010212002101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010212002101 is an equidigital number, since it uses as much as digits as its factorization.
1010212002101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1010212002101 its reverse (1012002120101), we get a palindrome (2022214122202).
The spelling of 1010212002101 in words is "one trillion, ten billion, two hundred twelve million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •