Base | Representation |
---|---|
bin | 111010100010… |
… | …0111111100101 |
3 | 2010202021112212 |
4 | 1311010333211 |
5 | 30324110201 |
6 | 3013453205 |
7 | 521605004 |
oct | 165047745 |
9 | 63667485 |
10 | 30691301 |
11 | 16362913 |
12 | a341205 |
13 | 6487844 |
14 | 410cc3b |
15 | 2a63abb |
hex | 1d44fe5 |
30691301 has 2 divisors, whose sum is σ = 30691302. Its totient is φ = 30691300.
The previous prime is 30691279. The next prime is 30691303. The reversal of 30691301 is 10319603.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17724100 + 12967201 = 4210^2 + 3601^2 .
It is a cyclic number.
It is not a de Polignac number, because 30691301 - 26 = 30691237 is a prime.
It is a Sophie Germain prime.
Together with 30691303, it forms a pair of twin primes.
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 (30691303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15345650 + 15345651.
It is an arithmetic number, because the mean of its divisors is an integer number (15345651).
Almost surely, 230691301 is an apocalyptic number.
It is an amenable number.
30691301 is a deficient number, since it is larger than the sum of its proper divisors (1).
30691301 is an equidigital number, since it uses as much as digits as its factorization.
30691301 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 30691301 is about 5539.9730143747. The cubic root of 30691301 is about 313.0918524465.
The spelling of 30691301 in words is "thirty million, six hundred ninety-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •