Base | Representation |
---|---|
bin | 1011111011111… |
… | …11010010011101 |
3 | 20222102102220012 |
4 | 11331333102131 |
5 | 201113323333 |
6 | 13534133005 |
7 | 2324066651 |
oct | 575772235 |
9 | 228372805 |
10 | 100136093 |
11 | 51584802 |
12 | 29651165 |
13 | 17990735 |
14 | d428a61 |
15 | 8bcee48 |
hex | 5f7f49d |
100136093 has 2 divisors, whose sum is σ = 100136094. Its totient is φ = 100136092.
The previous prime is 100136053. The next prime is 100136131. The reversal of 100136093 is 390631001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 69189124 + 30946969 = 8318^2 + 5563^2 .
It is an emirp because it is prime and its reverse (390631001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100136093 - 28 = 100135837 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100136053) 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, 50068046 + 50068047.
It is an arithmetic number, because the mean of its divisors is an integer number (50068047).
Almost surely, 2100136093 is an apocalyptic number.
It is an amenable number.
100136093 is a deficient number, since it is larger than the sum of its proper divisors (1).
100136093 is an equidigital number, since it uses as much as digits as its factorization.
100136093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
The square root of 100136093 is about 10006.8023364110. The cubic root of 100136093 is about 464.3693504962.
Adding to 100136093 its reverse (390631001), we get a palindrome (490767094).
The spelling of 100136093 in words is "one hundred million, one hundred thirty-six thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •