Base | Representation |
---|---|
bin | 1101110000001001111100… |
… | …10100100011011110000101 |
3 | 10222002002122201121121121202 |
4 | 12320010332110203132011 |
5 | 12430440413014303233 |
6 | 144152535232352245 |
7 | 6240622505151251 |
oct | 670047624433605 |
9 | 128062581547552 |
10 | 30241910306693 |
11 | 96aa581a65a58 |
12 | 34851026a5685 |
13 | 13b4a52512867 |
14 | 767a05627261 |
15 | 3769dc7cbbe8 |
hex | 1b813e523785 |
30241910306693 has 2 divisors, whose sum is σ = 30241910306694. Its totient is φ = 30241910306692.
The previous prime is 30241910306639. The next prime is 30241910306701. The reversal of 30241910306693 is 39660301914203.
Together with previous prime (30241910306639) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15438754091524 + 14803156215169 = 3929218^2 + 3847487^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30241910306693 is a prime.
It is a Sophie Germain 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 (30241910306393) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15120955153346 + 15120955153347.
It is an arithmetic number, because the mean of its divisors is an integer number (15120955153347).
Almost surely, 230241910306693 is an apocalyptic number.
It is an amenable number.
30241910306693 is a deficient number, since it is larger than the sum of its proper divisors (1).
30241910306693 is an equidigital number, since it uses as much as digits as its factorization.
30241910306693 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 629856, while the sum is 47.
The spelling of 30241910306693 in words is "thirty trillion, two hundred forty-one billion, nine hundred ten million, three hundred six thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •