Base | Representation |
---|---|
bin | 1101111010000000000101… |
… | …00000110010001011111001 |
3 | 11000021102212100211220000210 |
4 | 12331000002200302023321 |
5 | 13002011232034433441 |
6 | 145012204302021333 |
7 | 6304230044133132 |
oct | 675000240621371 |
9 | 130242770756023 |
10 | 30580209296121 |
11 | 981aaa2a17931 |
12 | 351a796277849 |
13 | 140a916b82494 |
14 | 77a13906ac89 |
15 | 3806dc46e616 |
hex | 1bd0028322f9 |
30580209296121 has 24 divisors (see below), whose sum is σ = 42155777681760. Its totient is φ = 19717713610560.
The previous prime is 30580209296111. The next prime is 30580209296171. The reversal of 30580209296121 is 12169290208503.
It is a happy number.
It is not a de Polignac number, because 30580209296121 - 25 = 30580209296089 is a prime.
It is not an unprimeable number, because it can be changed into a prime (30580209296111) 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 23 ways as a sum of consecutive naturals, for example, 1889325 + ... + 8045493.
It is an arithmetic number, because the mean of its divisors is an integer number (1756490736740).
Almost surely, 230580209296121 is an apocalyptic number.
30580209296121 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
30580209296121 is a deficient number, since it is larger than the sum of its proper divisors (11575568385639).
30580209296121 is a wasteful number, since it uses less digits than its factorization.
30580209296121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6157957 (or 6157926 counting only the distinct ones).
The product of its (nonzero) digits is 466560, while the sum is 48.
The spelling of 30580209296121 in words is "thirty trillion, five hundred eighty billion, two hundred nine million, two hundred ninety-six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •