Base | Representation |
---|---|
bin | 1101110010110010010011… |
… | …11101110111111101110001 |
3 | 10222101201222010202212000122 |
4 | 12321121021331313331301 |
5 | 12433431022300014022 |
6 | 144302244413300025 |
7 | 6250302445655231 |
oct | 671311175677561 |
9 | 128351863685018 |
10 | 30332300001137 |
11 | 9734946653272 |
12 | 349a729a94615 |
13 | 13c0428ca8764 |
14 | 76c13c1a5cc1 |
15 | 37902ce83742 |
hex | 1b9649f77f71 |
30332300001137 has 2 divisors, whose sum is σ = 30332300001138. Its totient is φ = 30332300001136.
The previous prime is 30332300001089. The next prime is 30332300001139. The reversal of 30332300001137 is 73110000323303.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29520140363536 + 812159637601 = 5433244^2 + 901199^2 .
It is a cyclic number.
It is not a de Polignac number, because 30332300001137 - 216 = 30332299935601 is a prime.
Together with 30332300001139, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (30332300001139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15166150000568 + 15166150000569.
It is an arithmetic number, because the mean of its divisors is an integer number (15166150000569).
Almost surely, 230332300001137 is an apocalyptic number.
It is an amenable number.
30332300001137 is a deficient number, since it is larger than the sum of its proper divisors (1).
30332300001137 is an equidigital number, since it uses as much as digits as its factorization.
30332300001137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3402, while the sum is 26.
The spelling of 30332300001137 in words is "thirty trillion, three hundred thirty-two billion, three hundred million, one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.349 sec. • engine limits •