Base | Representation |
---|---|
bin | 1101110011101111011011… |
… | …01110010001100001011101 |
3 | 10222111212122212121111221200 |
4 | 12321313231232101201131 |
5 | 12440000222202133023 |
6 | 144325312343350113 |
7 | 6252543533414211 |
oct | 671675556214135 |
9 | 128455585544850 |
10 | 30365112146013 |
11 | 974785420a377 |
12 | 34a4b66752339 |
13 | 13c3557b609b8 |
14 | 76d971cb6941 |
15 | 379ced8e5743 |
hex | 1b9dedb9185d |
30365112146013 has 48 divisors (see below), whose sum is σ = 45591712002096. Its totient is φ = 19458593971200.
The previous prime is 30365112145943. The next prime is 30365112146023. The reversal of 30365112146013 is 31064121156303.
30365112146013 is a `hidden beast` number, since 3 + 0 + 3 + 65 + 1 + 121 + 460 + 13 = 666.
It can be written as a sum of positive squares in 8 ways, for example, as 6892656899769 + 23472455246244 = 2625387^2 + 4844838^2 .
It is not a de Polignac number, because 30365112146013 - 222 = 30365107951709 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30365112146023) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 14382495 + ... + 16358067.
It is an arithmetic number, because the mean of its divisors is an integer number (949827333377).
Almost surely, 230365112146013 is an apocalyptic number.
It is an amenable number.
30365112146013 is a deficient number, since it is larger than the sum of its proper divisors (15226599856083).
30365112146013 is a wasteful number, since it uses less digits than its factorization.
30365112146013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1976174 (or 1976171 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 36.
The spelling of 30365112146013 in words is "thirty trillion, three hundred sixty-five billion, one hundred twelve million, one hundred forty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •