Base | Representation |
---|---|
bin | 1001001100011110101110… |
… | …0111101100111110100101 |
3 | 1022210111201001112020001001 |
4 | 2103013223213230332211 |
5 | 2311120300320213333 |
6 | 33300250332433301 |
7 | 2062265333311411 |
oct | 223075347547645 |
9 | 38714631466031 |
10 | 10110011101093 |
11 | 32486a4776592 |
12 | 117347a318831 |
13 | 5844a6a41207 |
14 | 26d4819a1d41 |
15 | 127eb7eceb7d |
hex | 931eb9ecfa5 |
10110011101093 has 2 divisors, whose sum is σ = 10110011101094. Its totient is φ = 10110011101092.
The previous prime is 10110011101087. The next prime is 10110011101109. The reversal of 10110011101093 is 39010111001101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7418961145729 + 2691049955364 = 2723777^2 + 1640442^2 .
It is a cyclic number.
It is not a de Polignac number, because 10110011101093 - 237 = 9972572147621 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10110011101093.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10110011101033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055005550546 + 5055005550547.
It is an arithmetic number, because the mean of its divisors is an integer number (5055005550547).
Almost surely, 210110011101093 is an apocalyptic number.
It is an amenable number.
10110011101093 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110011101093 is an equidigital number, since it uses as much as digits as its factorization.
10110011101093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27, while the sum is 19.
Adding to 10110011101093 its reverse (39010111001101), we get a palindrome (49120122102194).
The spelling of 10110011101093 in words is "ten trillion, one hundred ten billion, eleven million, one hundred one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •