Base | Representation |
---|---|
bin | 1011111101010… |
… | …10100000000101 |
3 | 20222202102200202 |
4 | 11332222200011 |
5 | 201140004333 |
6 | 13542020245 |
7 | 2325434666 |
oct | 576524005 |
9 | 228672622 |
10 | 100313093 |
11 | 51695791 |
12 | 29717685 |
13 | 17a2317a |
14 | d47336d |
15 | 8c175e8 |
hex | 5faa805 |
100313093 has 2 divisors, whose sum is σ = 100313094. Its totient is φ = 100313092.
The previous prime is 100313071. The next prime is 100313113. The reversal of 100313093 is 390313001.
It is an a-pointer prime, because the next prime (100313113) can be obtained adding 100313093 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99161764 + 1151329 = 9958^2 + 1073^2 .
It is a cyclic number.
It is not a de Polignac number, because 100313093 - 212 = 100308997 is a prime.
It is a zygodrome in base 4.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100313033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50156546 + 50156547.
It is an arithmetic number, because the mean of its divisors is an integer number (50156547).
Almost surely, 2100313093 is an apocalyptic number.
It is an amenable number.
100313093 is a deficient number, since it is larger than the sum of its proper divisors (1).
100313093 is an equidigital number, since it uses as much as digits as its factorization.
100313093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243, while the sum is 20.
The square root of 100313093 is about 10015.6424157415. The cubic root of 100313093 is about 464.6427950052.
Adding to 100313093 its reverse (390313001), we get a palindrome (490626094).
The spelling of 100313093 in words is "one hundred million, three hundred thirteen thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •