Base | Representation |
---|---|
bin | 1101111011000000111111… |
… | …00000100110001000101101 |
3 | 11000101202210212011200211001 |
4 | 12331200133200212020231 |
5 | 13003044113203240042 |
6 | 145040210133400301 |
7 | 6306602421160321 |
oct | 675403740461055 |
9 | 130352725150731 |
10 | 30615055524397 |
11 | 983385478a9a3 |
12 | 35254a0199091 |
13 | 1410cab286576 |
14 | 77bac2d89981 |
15 | 38157b777bb7 |
hex | 1bd81f82622d |
30615055524397 has 2 divisors, whose sum is σ = 30615055524398. Its totient is φ = 30615055524396.
The previous prime is 30615055524299. The next prime is 30615055524457. The reversal of 30615055524397 is 79342555051603.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22609064500201 + 8005991024196 = 4754899^2 + 2829486^2 .
It is an emirp because it is prime and its reverse (79342555051603) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30615055524397 - 235 = 30580695786029 is a prime.
It is a super-2 number, since 2×306150555243972 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30615055528397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15307527762198 + 15307527762199.
It is an arithmetic number, because the mean of its divisors is an integer number (15307527762199).
Almost surely, 230615055524397 is an apocalyptic number.
It is an amenable number.
30615055524397 is a deficient number, since it is larger than the sum of its proper divisors (1).
30615055524397 is an equidigital number, since it uses as much as digits as its factorization.
30615055524397 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17010000, while the sum is 55.
The spelling of 30615055524397 in words is "thirty trillion, six hundred fifteen billion, fifty-five million, five hundred twenty-four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •