Base | Representation |
---|---|
bin | 1001001011111101100110… |
… | …1111011101011011101101 |
3 | 1022202122202111121222011211 |
4 | 2102333121233131123231 |
5 | 2310444044012210333 |
6 | 33252220243314421 |
7 | 2061532125425014 |
oct | 222773157353355 |
9 | 38678674558154 |
10 | 10101121210093 |
11 | 3244952650931 |
12 | 11717b907ba11 |
13 | 5836bb033a94 |
14 | 26cc7b04da7b |
15 | 127b47802ecd |
hex | 92fd9bdd6ed |
10101121210093 has 2 divisors, whose sum is σ = 10101121210094. Its totient is φ = 10101121210092.
The previous prime is 10101121210073. The next prime is 10101121210139. The reversal of 10101121210093 is 39001212110101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5340965968809 + 4760155241284 = 2311053^2 + 2181778^2 .
It is a cyclic number.
It is not a de Polignac number, because 10101121210093 - 233 = 10092531275501 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10101121210073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050560605046 + 5050560605047.
It is an arithmetic number, because the mean of its divisors is an integer number (5050560605047).
Almost surely, 210101121210093 is an apocalyptic number.
It is an amenable number.
10101121210093 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101121210093 is an equidigital number, since it uses as much as digits as its factorization.
10101121210093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 22.
Adding to 10101121210093 its reverse (39001212110101), we get a palindrome (49102333320194).
The spelling of 10101121210093 in words is "ten trillion, one hundred one billion, one hundred twenty-one million, two hundred ten thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •