Base | Representation |
---|---|
bin | 11101011001101010100… |
… | …01100110100010010101 |
3 | 10120120112100110010120212 |
4 | 32230311101212202111 |
5 | 113022403021340201 |
6 | 2052030134135205 |
7 | 132661654564664 |
oct | 16546521464225 |
9 | 3516470403525 |
10 | 1010211121301 |
11 | 35a478929518 |
12 | 1439517b1505 |
13 | 74354935355 |
14 | 36c74644ddb |
15 | 1b427e28abb |
hex | eb35466895 |
1010211121301 has 2 divisors, whose sum is σ = 1010211121302. Its totient is φ = 1010211121300.
The previous prime is 1010211121267. The next prime is 1010211121327. The reversal of 1010211121301 is 1031211120101.
1010211121301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 957403540900 + 52807580401 = 978470^2 + 229799^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010211121301 - 230 = 1009137379477 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010211121501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505105560650 + 505105560651.
It is an arithmetic number, because the mean of its divisors is an integer number (505105560651).
Almost surely, 21010211121301 is an apocalyptic number.
It is an amenable number.
1010211121301 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010211121301 is an equidigital number, since it uses as much as digits as its factorization.
1010211121301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 1010211121301 its reverse (1031211120101), we get a palindrome (2041422241402).
The spelling of 1010211121301 in words is "one trillion, ten billion, two hundred eleven million, one hundred twenty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •