Base | Representation |
---|---|
bin | 1101110010010000010000… |
… | …10000000101011010000001 |
3 | 10222022222210000020010021201 |
4 | 12321020020100011122001 |
5 | 12433131102001444340 |
6 | 144250022322221201 |
7 | 6246054421131361 |
oct | 671101020053201 |
9 | 128288700203251 |
10 | 30314017609345 |
11 | 9728114723768 |
12 | 34970871b4801 |
13 | 13bb7a4403c52 |
14 | 76b2c606a9a1 |
15 | 37880cde879a |
hex | 1b9208405681 |
30314017609345 has 8 divisors (see below), whose sum is σ = 36426448449576. Its totient is φ = 24218129208576.
The previous prime is 30314017609331. The next prime is 30314017609417. The reversal of 30314017609345 is 54390671041303.
It can be written as a sum of positive squares in 4 ways, for example, as 10779986657521 + 19534030951824 = 3283289^2 + 4419732^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 30314017609345 - 229 = 30313480738433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30314017609295 and 30314017609304.
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, 4135605832 + ... + 4135613161.
It is an arithmetic number, because the mean of its divisors is an integer number (4553306056197).
Almost surely, 230314017609345 is an apocalyptic number.
It is an amenable number.
30314017609345 is a deficient number, since it is larger than the sum of its proper divisors (6112430840231).
30314017609345 is an equidigital number, since it uses as much as digits as its factorization.
30314017609345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8271219731.
The product of its (nonzero) digits is 816480, while the sum is 46.
The spelling of 30314017609345 in words is "thirty trillion, three hundred fourteen billion, seventeen million, six hundred nine thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •