Base | Representation |
---|---|
bin | 1101110111101010110001… |
… | …01001010101100101000001 |
3 | 10222222202221220222202002122 |
4 | 12323311120221111211001 |
5 | 12444203100300001233 |
6 | 144511310214054025 |
7 | 6265361446303664 |
oct | 673653051254501 |
9 | 128882856882078 |
10 | 30500050000193 |
11 | 9799aa90aa424 |
12 | 350714504a315 |
13 | 14031b0a45527 |
14 | 7762d30a76db |
15 | 37d599ed6d98 |
hex | 1bbd58a55941 |
30500050000193 has 2 divisors, whose sum is σ = 30500050000194. Its totient is φ = 30500050000192.
The previous prime is 30500050000163. The next prime is 30500050000289. The reversal of 30500050000193 is 39100005000503.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19040586056704 + 11459463943489 = 4363552^2 + 3385183^2 .
It is a cyclic number.
It is not a de Polignac number, because 30500050000193 - 234 = 30482870131009 is a prime.
It is not a weakly prime, because it can be changed into another prime (30500050000153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15250025000096 + 15250025000097.
It is an arithmetic number, because the mean of its divisors is an integer number (15250025000097).
Almost surely, 230500050000193 is an apocalyptic number.
It is an amenable number.
30500050000193 is a deficient number, since it is larger than the sum of its proper divisors (1).
30500050000193 is an equidigital number, since it uses as much as digits as its factorization.
30500050000193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2025, while the sum is 26.
Adding to 30500050000193 its reverse (39100005000503), we get a palindrome (69600055000696).
The spelling of 30500050000193 in words is "thirty trillion, five hundred billion, fifty million, one hundred ninety-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •