Base | Representation |
---|---|
bin | 1101111011000000001011… |
… | …00011011001101010010001 |
3 | 11000101201200111202102010221 |
4 | 12331200011203121222101 |
5 | 13003042220213131423 |
6 | 145040055015553041 |
7 | 6306555552545656 |
oct | 675400543315221 |
9 | 130351614672127 |
10 | 30614620052113 |
11 | 9833650997149 |
12 | 352539a38b781 |
13 | 1410c3bca5266 |
14 | 77ba811cdc2d |
15 | 381553408e5d |
hex | 1bd8058d9a91 |
30614620052113 has 2 divisors, whose sum is σ = 30614620052114. Its totient is φ = 30614620052112.
The previous prime is 30614620052057. The next prime is 30614620052131. The reversal of 30614620052113 is 31125002641603.
Together with next prime (30614620052131) 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., 30228751732624 + 385868319489 = 5498068^2 + 621183^2 .
It is a cyclic number.
It is not a de Polignac number, because 30614620052113 - 225 = 30614586497681 is a prime.
It is not a weakly prime, because it can be changed into another prime (30614620052143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15307310026056 + 15307310026057.
It is an arithmetic number, because the mean of its divisors is an integer number (15307310026057).
Almost surely, 230614620052113 is an apocalyptic number.
It is an amenable number.
30614620052113 is a deficient number, since it is larger than the sum of its proper divisors (1).
30614620052113 is an equidigital number, since it uses as much as digits as its factorization.
30614620052113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 34.
Adding to 30614620052113 its reverse (31125002641603), we get a palindrome (61739622693716).
The spelling of 30614620052113 in words is "thirty trillion, six hundred fourteen billion, six hundred twenty million, fifty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •