Base | Representation |
---|---|
bin | 1101110111110010101110… |
… | …01110011000000000000001 |
3 | 11000000011222120212020011111 |
4 | 12323321113032120000001 |
5 | 12444240322201403210 |
6 | 144513254111043321 |
7 | 6265602341244022 |
oct | 673712716300001 |
9 | 130004876766144 |
10 | 30504321122305 |
11 | 97a08a0033708 |
12 | 3507b37510541 |
13 | 1403711893714 |
14 | 7765ba434c49 |
15 | 37d749e6488a |
hex | 1bbe57398001 |
30504321122305 has 8 divisors (see below), whose sum is σ = 36872376481512. Its totient is φ = 24225329474688.
The previous prime is 30504321122251. The next prime is 30504321122311. The reversal of 30504321122305 is 50322112340503.
It can be written as a sum of positive squares in 4 ways, for example, as 7251258009856 + 23253063112449 = 2692816^2 + 4822143^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30504321122305 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22265927142 + ... + 22265928511.
It is an arithmetic number, because the mean of its divisors is an integer number (4609047060189).
Almost surely, 230504321122305 is an apocalyptic number.
It is an amenable number.
30504321122305 is a deficient number, since it is larger than the sum of its proper divisors (6368055359207).
30504321122305 is a wasteful number, since it uses less digits than its factorization.
30504321122305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44531855795.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 30504321122305 its reverse (50322112340503), we get a palindrome (80826433462808).
The spelling of 30504321122305 in words is "thirty trillion, five hundred four billion, three hundred twenty-one million, one hundred twenty-two thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •