Base | Representation |
---|---|
bin | 1011001010111… |
… | …01100001001001 |
3 | 20112022202220012 |
4 | 11211131201021 |
5 | 142442100223 |
6 | 13144241305 |
7 | 2215330151 |
oct | 545354111 |
9 | 215282805 |
10 | 93706313 |
11 | 48992a38 |
12 | 27470235 |
13 | 1654bc2c |
14 | c633761 |
15 | 835ec78 |
hex | 595d849 |
93706313 has 2 divisors, whose sum is σ = 93706314. Its totient is φ = 93706312.
The previous prime is 93706307. The next prime is 93706339. The reversal of 93706313 is 31360739.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 60031504 + 33674809 = 7748^2 + 5803^2 .
It is an emirp because it is prime and its reverse (31360739) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 93706313 - 214 = 93689929 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 93706313.
It is not a weakly prime, because it can be changed into another prime (93706303) 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, 46853156 + 46853157.
It is an arithmetic number, because the mean of its divisors is an integer number (46853157).
Almost surely, 293706313 is an apocalyptic number.
It is an amenable number.
93706313 is a deficient number, since it is larger than the sum of its proper divisors (1).
93706313 is an equidigital number, since it uses as much as digits as its factorization.
93706313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10206, while the sum is 32.
The square root of 93706313 is about 9680.2021156585. The cubic root of 93706313 is about 454.2095732023.
The spelling of 93706313 in words is "ninety-three million, seven hundred six thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •