Base | Representation |
---|---|
bin | 11100011011110000… |
… | …110100010011000101 |
3 | 2220210201121210022022 |
4 | 130123300310103011 |
5 | 1000011310144104 |
6 | 22005303412525 |
7 | 2130401263454 |
oct | 343360642305 |
9 | 86721553268 |
10 | 30530553029 |
11 | 11a47779409 |
12 | 5b00754145 |
13 | 2b57286ac2 |
14 | 1698ab4b9b |
15 | bda4c9bbe |
hex | 71bc344c5 |
30530553029 has 2 divisors, whose sum is σ = 30530553030. Its totient is φ = 30530553028.
The previous prime is 30530553013. The next prime is 30530553077. The reversal of 30530553029 is 92035503503.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18326932129 + 12203620900 = 135377^2 + 110470^2 .
It is a cyclic number.
It is not a de Polignac number, because 30530553029 - 24 = 30530553013 is a prime.
It is a super-2 number, since 2×305305530292 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 30530553029.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30530553629) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15265276514 + 15265276515.
It is an arithmetic number, because the mean of its divisors is an integer number (15265276515).
Almost surely, 230530553029 is an apocalyptic number.
It is an amenable number.
30530553029 is a deficient number, since it is larger than the sum of its proper divisors (1).
30530553029 is an equidigital number, since it uses as much as digits as its factorization.
30530553029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60750, while the sum is 35.
The spelling of 30530553029 in words is "thirty billion, five hundred thirty million, five hundred fifty-three thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •