Base | Representation |
---|---|
bin | 1001001011111101100100… |
… | …1000111001011010100101 |
3 | 1022202122201210121101020102 |
4 | 2102333121020321122211 |
5 | 2310444033420213333 |
6 | 33252215242513445 |
7 | 2061531643462505 |
oct | 222773110713245 |
9 | 38678653541212 |
10 | 10101111101093 |
11 | 3244947976891 |
12 | 11717b5805885 |
13 | 5836b8c0471c |
14 | 26cc7997ba05 |
15 | 127b469a7ae8 |
hex | 92fd92396a5 |
10101111101093 has 2 divisors, whose sum is σ = 10101111101094. Its totient is φ = 10101111101092.
The previous prime is 10101111101089. The next prime is 10101111101173. The reversal of 10101111101093 is 39010111110101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7934097463009 + 2167013638084 = 2816753^2 + 1472078^2 .
It is a cyclic number.
It is not a de Polignac number, because 10101111101093 - 22 = 10101111101089 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10101111101023) 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, 5050555550546 + 5050555550547.
It is an arithmetic number, because the mean of its divisors is an integer number (5050555550547).
Almost surely, 210101111101093 is an apocalyptic number.
It is an amenable number.
10101111101093 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101111101093 is an equidigital number, since it uses as much as digits as its factorization.
10101111101093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 20.
Adding to 10101111101093 its reverse (39010111110101), we get a palindrome (49111222211194).
The spelling of 10101111101093 in words is "ten trillion, one hundred one billion, one hundred eleven million, one hundred one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •