Base | Representation |
---|---|
bin | 1001001011111101101001… |
… | …0100110100000010100101 |
3 | 1022202122210012001110011211 |
4 | 2102333122110310002211 |
5 | 2310444104014031041 |
6 | 33252221233231421 |
7 | 2061532304566633 |
oct | 222773224640245 |
9 | 38678705043154 |
10 | 10101131002021 |
11 | 3244958129734 |
12 | 1171800402571 |
13 | 5836c0081a17 |
14 | 26cc7c47c353 |
15 | 127b485d9481 |
hex | 92fda5340a5 |
10101131002021 has 2 divisors, whose sum is σ = 10101131002022. Its totient is φ = 10101131002020.
The previous prime is 10101131001967. The next prime is 10101131002057. The reversal of 10101131002021 is 12020013110101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6136197808225 + 3964933193796 = 2477135^2 + 1991214^2 .
It is a cyclic number.
It is not a de Polignac number, because 10101131002021 - 217 = 10101130870949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10101131001992 and 10101131002010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10101131002621) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050565501010 + 5050565501011.
It is an arithmetic number, because the mean of its divisors is an integer number (5050565501011).
Almost surely, 210101131002021 is an apocalyptic number.
It is an amenable number.
10101131002021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101131002021 is an equidigital number, since it uses as much as digits as its factorization.
10101131002021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 10101131002021 its reverse (12020013110101), we get a palindrome (22121144112122).
The spelling of 10101131002021 in words is "ten trillion, one hundred one billion, one hundred thirty-one million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •