Base | Representation |
---|---|
bin | 11011111101111111… |
… | …100011101001100001 |
3 | 2212111220210222020222 |
4 | 123331333203221201 |
5 | 443000430204023 |
6 | 21443542412425 |
7 | 2112125066621 |
oct | 337577435141 |
9 | 85456728228 |
10 | 30031100513 |
11 | 11810856337 |
12 | 59a1431115 |
13 | 2aa7963c7b |
14 | 164c622881 |
15 | bab71dcc8 |
hex | 6fdfe3a61 |
30031100513 has 2 divisors, whose sum is σ = 30031100514. Its totient is φ = 30031100512.
The previous prime is 30031100507. The next prime is 30031100557. The reversal of 30031100513 is 31500113003.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18287693824 + 11743406689 = 135232^2 + 108367^2 .
It is an emirp because it is prime and its reverse (31500113003) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30031100513 - 210 = 30031099489 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30031100491 and 30031100500.
It is not a weakly prime, because it can be changed into another prime (30031100573) 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, 15015550256 + 15015550257.
It is an arithmetic number, because the mean of its divisors is an integer number (15015550257).
Almost surely, 230031100513 is an apocalyptic number.
It is an amenable number.
30031100513 is a deficient number, since it is larger than the sum of its proper divisors (1).
30031100513 is an equidigital number, since it uses as much as digits as its factorization.
30031100513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135, while the sum is 17.
Adding to 30031100513 its reverse (31500113003), we get a palindrome (61531213516).
The spelling of 30031100513 in words is "thirty billion, thirty-one million, one hundred thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •