Base | Representation |
---|---|
bin | 1101110101000101100000… |
… | …01100000010101010001011 |
3 | 10222200021221111010101000220 |
4 | 12322202300030002222023 |
5 | 12441224343021333230 |
6 | 144402434120401123 |
7 | 6256100653205343 |
oct | 672426014025213 |
9 | 128607844111026 |
10 | 30411324402315 |
11 | 976540889252a |
12 | 34b1b030161a3 |
13 | 13c7a10c67b5c |
14 | 771cb7545d23 |
15 | 37b105990d10 |
hex | 1ba8b0302a8b |
30411324402315 has 16 divisors (see below), whose sum is σ = 48693870817056. Its totient is φ = 16207455756800.
The previous prime is 30411324402241. The next prime is 30411324402317. The reversal of 30411324402315 is 51320442311403.
It is not a de Polignac number, because 30411324402315 - 210 = 30411324401291 is a prime.
It is not an unprimeable number, because it can be changed into a prime (30411324402317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 744807516 + ... + 744848345.
It is an arithmetic number, because the mean of its divisors is an integer number (3043366926066).
Almost surely, 230411324402315 is an apocalyptic number.
30411324402315 is a deficient number, since it is larger than the sum of its proper divisors (18282546414741).
30411324402315 is a wasteful number, since it uses less digits than its factorization.
30411324402315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1489657230.
The product of its (nonzero) digits is 34560, while the sum is 33.
Adding to 30411324402315 its reverse (51320442311403), we get a palindrome (81731766713718).
It can be divided in two parts, 3041132 and 4402315, that added together give a palindrome (7443447).
The spelling of 30411324402315 in words is "thirty trillion, four hundred eleven billion, three hundred twenty-four million, four hundred two thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •