Base | Representation |
---|---|
bin | 101111100101110101… |
… | …0010011101000000101 |
3 | 100202210120102110202212 |
4 | 1133023222103220011 |
5 | 3133301441104333 |
6 | 114541152313205 |
7 | 10245432061562 |
oct | 1371352235005 |
9 | 322716373685 |
10 | 102201113093 |
11 | 3a385955a32 |
12 | 17982b42805 |
13 | 9839840921 |
14 | 4d3750b869 |
15 | 29d25c6448 |
hex | 17cba93a05 |
102201113093 has 2 divisors, whose sum is σ = 102201113094. Its totient is φ = 102201113092.
The previous prime is 102201113089. The next prime is 102201113101. The reversal of 102201113093 is 390311102201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 75225678529 + 26975434564 = 274273^2 + 164242^2 .
It is an emirp because it is prime and its reverse (390311102201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102201113093 - 22 = 102201113089 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102201113293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51100556546 + 51100556547.
It is an arithmetic number, because the mean of its divisors is an integer number (51100556547).
Almost surely, 2102201113093 is an apocalyptic number.
It is an amenable number.
102201113093 is a deficient number, since it is larger than the sum of its proper divisors (1).
102201113093 is an equidigital number, since it uses as much as digits as its factorization.
102201113093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 102201113093 its reverse (390311102201), we get a palindrome (492512215294).
The spelling of 102201113093 in words is "one hundred two billion, two hundred one million, one hundred thirteen thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •