Base | Representation |
---|---|
bin | 1101111100010101001100… |
… | …01111001110000100111101 |
3 | 11000120002111121211210111210 |
4 | 12332022212033032010331 |
5 | 13004314210441112100 |
6 | 145113044225435033 |
7 | 6313062651166320 |
oct | 676124617160475 |
9 | 130502447753453 |
10 | 30660265566525 |
11 | 9850a44667781 |
12 | 35321b8a9ba79 |
13 | 141533485979a |
14 | 77dd714927b7 |
15 | 382825855c50 |
hex | 1be2a63ce13d |
30660265566525 has 48 divisors (see below), whose sum is σ = 61341143094144. Its totient is φ = 13191643668480.
The previous prime is 30660265566523. The next prime is 30660265566563. The reversal of 30660265566525 is 52566556206603.
It is not a de Polignac number, because 30660265566525 - 21 = 30660265566523 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30660265566523) 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, 1717653012 + ... + 1717670861.
It is an arithmetic number, because the mean of its divisors is an integer number (1277940481128).
Almost surely, 230660265566525 is an apocalyptic number.
30660265566525 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
30660265566525 is an abundant number, since it is smaller than the sum of its proper divisors (30680877527619).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30660265566525 is a wasteful number, since it uses less digits than its factorization.
30660265566525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3435323910 (or 3435323905 counting only the distinct ones).
The product of its (nonzero) digits is 58320000, while the sum is 57.
The spelling of 30660265566525 in words is "thirty trillion, six hundred sixty billion, two hundred sixty-five million, five hundred sixty-six thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •