Base | Representation |
---|---|
bin | 1101110111111010111111… |
… | …00100010010110000001101 |
3 | 11000000121102122222001101002 |
4 | 12323331133210102300031 |
5 | 12444323413022144010 |
6 | 144515310135030045 |
7 | 6266120262445106 |
oct | 673753744226015 |
9 | 130017378861332 |
10 | 30508756053005 |
11 | 97a276648079a |
12 | 350897480b325 |
13 | 1403c6a636a79 |
14 | 7768bb4433ad |
15 | 37d90949d1a5 |
hex | 1bbf5f912c0d |
30508756053005 has 8 divisors (see below), whose sum is σ = 36611119500792. Its totient is φ = 24406596684288.
The previous prime is 30508756052989. The next prime is 30508756053031. The reversal of 30508756053005 is 50035065780503.
It can be written as a sum of positive squares in 4 ways, for example, as 4857347115721 + 25651408937284 = 2203939^2 + 5064722^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30508756053005 - 24 = 30508756052989 is a prime.
It is a super-3 number, since 3×305087560530053 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent 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, 50690684 + ... + 51289013.
It is an arithmetic number, because the mean of its divisors is an integer number (4576389937599).
Almost surely, 230508756053005 is an apocalyptic number.
It is an amenable number.
30508756053005 is a deficient number, since it is larger than the sum of its proper divisors (6102363447787).
30508756053005 is a wasteful number, since it uses less digits than its factorization.
30508756053005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102039535.
The product of its (nonzero) digits is 1890000, while the sum is 47.
The spelling of 30508756053005 in words is "thirty trillion, five hundred eight billion, seven hundred fifty-six million, fifty-three thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •