Base | Representation |
---|---|
bin | 101111000010010111… |
… | …0110011110010110101 |
3 | 100122201122020002220201 |
4 | 1132010232303302311 |
5 | 3123332321023333 |
6 | 114223122400501 |
7 | 10204102164154 |
oct | 1360456636265 |
9 | 318648202821 |
10 | 101011111093 |
11 | 39925158902 |
12 | 176b0500131 |
13 | 96aa13a129 |
14 | 4c6346159b |
15 | 2962db317d |
hex | 1784bb3cb5 |
101011111093 has 2 divisors, whose sum is σ = 101011111094. Its totient is φ = 101011111092.
The previous prime is 101011111079. The next prime is 101011111121. The reversal of 101011111093 is 390111110101.
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., 100113389649 + 897721444 = 316407^2 + 29962^2 .
It is a cyclic number.
It is not a de Polignac number, because 101011111093 - 29 = 101011110581 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101011111093.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101011111063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505555546 + 50505555547.
It is an arithmetic number, because the mean of its divisors is an integer number (50505555547).
Almost surely, 2101011111093 is an apocalyptic number.
It is an amenable number.
101011111093 is a deficient number, since it is larger than the sum of its proper divisors (1).
101011111093 is an equidigital number, since it uses as much as digits as its factorization.
101011111093 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 19.
Adding to 101011111093 its reverse (390111110101), we get a palindrome (491122221194).
The spelling of 101011111093 in words is "one hundred one billion, eleven million, one hundred eleven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •