Base | Representation |
---|---|
bin | 11100011100101000… |
… | …000011101110001101 |
3 | 2220211201212111122012 |
4 | 130130220003232031 |
5 | 1000024012043000 |
6 | 22010542031005 |
7 | 2130635335424 |
oct | 343450035615 |
9 | 86751774565 |
10 | 30545034125 |
11 | 11a5496a261 |
12 | 5b05578465 |
13 | 2b5a2871b8 |
14 | 169a9a42bb |
15 | bdb8da735 |
hex | 71ca03b8d |
30545034125 has 32 divisors (see below), whose sum is σ = 40676438400. Its totient is φ = 22832668800.
The previous prime is 30545034031. The next prime is 30545034127. The reversal of 30545034125 is 52143054503.
It is a happy number.
It is not a de Polignac number, because 30545034125 - 216 = 30544968589 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a junction number, because it is equal to n+sod(n) for n = 30545034091 and 30545034100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30545034127) 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 in 31 ways as a sum of consecutive naturals, for example, 85286 + ... + 261464.
It is an arithmetic number, because the mean of its divisors is an integer number (1271138700).
Almost surely, 230545034125 is an apocalyptic number.
It is an amenable number.
30545034125 is a deficient number, since it is larger than the sum of its proper divisors (10131404275).
30545034125 is a wasteful number, since it uses less digits than its factorization.
30545034125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176286 (or 176276 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 32.
Adding to 30545034125 its reverse (52143054503), we get a palindrome (82688088628).
The spelling of 30545034125 in words is "thirty billion, five hundred forty-five million, thirty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •