Base | Representation |
---|---|
bin | 1101111011000001010100… |
… | …10010101101110011001001 |
3 | 11000101210021110120220201010 |
4 | 12331200222102231303021 |
5 | 13003100001011411040 |
6 | 145040240115114133 |
7 | 6306610045661025 |
oct | 675405222556311 |
9 | 130353243526633 |
10 | 30615236435145 |
11 | 983393791490a |
12 | 35255308a2949 |
13 | 14110098b8b4b |
14 | 77badcddd385 |
15 | 38158c5b0e80 |
hex | 1bd82a4adcc9 |
30615236435145 has 16 divisors (see below), whose sum is σ = 48984452231040. Its totient is φ = 16328101453824.
The previous prime is 30615236435143. The next prime is 30615236435171. The reversal of 30615236435145 is 54153463251603.
It is not a de Polignac number, because 30615236435145 - 21 = 30615236435143 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30615236435094 and 30615236435103.
It is not an unprimeable number, because it can be changed into a prime (30615236435143) 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 in 15 ways as a sum of consecutive naturals, for example, 13409737 + ... + 15525833.
It is an arithmetic number, because the mean of its divisors is an integer number (3061528264440).
Almost surely, 230615236435145 is an apocalyptic number.
It is an amenable number.
30615236435145 is a deficient number, since it is larger than the sum of its proper divisors (18369215795895).
30615236435145 is a wasteful number, since it uses less digits than its factorization.
30615236435145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3080624.
The product of its (nonzero) digits is 3888000, while the sum is 48.
Adding to 30615236435145 its reverse (54153463251603), we get a palindrome (84768699686748).
The spelling of 30615236435145 in words is "thirty trillion, six hundred fifteen billion, two hundred thirty-six million, four hundred thirty-five thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •