Base | Representation |
---|---|
bin | 1101110001011011100100… |
… | …10001111101101110101101 |
3 | 10222020021202201022212012202 |
4 | 12320231302101331232231 |
5 | 12432200134304403023 |
6 | 144225023441311245 |
7 | 6244033444040144 |
oct | 670556221755655 |
9 | 128207681285182 |
10 | 30285731716013 |
11 | 971711a008414 |
12 | 34916b2335525 |
13 | 13b8c171b7267 |
14 | 769ba153a75b |
15 | 377c04a0d128 |
hex | 1b8b7247dbad |
30285731716013 has 2 divisors, whose sum is σ = 30285731716014. Its totient is φ = 30285731716012.
The previous prime is 30285731715989. The next prime is 30285731716043. The reversal of 30285731716013 is 31061713758203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20517837834244 + 9767893881769 = 4529662^2 + 3125363^2 .
It is an emirp because it is prime and its reverse (31061713758203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30285731716013 - 230 = 30284657974189 is a prime.
It is a super-3 number, since 3×302857317160133 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30285731716043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15142865858006 + 15142865858007.
It is an arithmetic number, because the mean of its divisors is an integer number (15142865858007).
Almost surely, 230285731716013 is an apocalyptic number.
It is an amenable number.
30285731716013 is a deficient number, since it is larger than the sum of its proper divisors (1).
30285731716013 is an equidigital number, since it uses as much as digits as its factorization.
30285731716013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 635040, while the sum is 47.
The spelling of 30285731716013 in words is "thirty trillion, two hundred eighty-five billion, seven hundred thirty-one million, seven hundred sixteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •