Base | Representation |
---|---|
bin | 1110000001001000100010… |
… | …10010010110011100101001 |
3 | 11001010212102002101002020021 |
4 | 13000210101102112130221 |
5 | 13020020123144302401 |
6 | 145320533402000441 |
7 | 6331023635301421 |
oct | 700442122263451 |
9 | 131125362332207 |
10 | 30825270306601 |
11 | 9904a18525161 |
12 | 355a1887a6121 |
13 | 1427a6c924664 |
14 | 787d4593d481 |
15 | 386c818842a1 |
hex | 1c0911496729 |
30825270306601 has 9 divisors (see below), whose sum is σ = 30983637414711. Its totient is φ = 30667708651272.
The previous prime is 30825270306539. The next prime is 30825270306613. The reversal of 30825270306601 is 10660307252803.
The square root of 30825270306601 is 5552051.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 30202553619225 + 622716687376 = 5495685^2 + 789124^2 .
It is a de Polignac number, because none of the positive numbers 2k-30825270306601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30825270306101) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1093739956 + ... + 1093768138.
Almost surely, 230825270306601 is an apocalyptic number.
30825270306601 is the 5552051-st square number.
30825270306601 is the 2776026-th centered octagonal number.
It is an amenable number.
30825270306601 is a deficient number, since it is larger than the sum of its proper divisors (158367108110).
30825270306601 is an frugal number, since it uses more digits than its factorization.
30825270306601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56760 (or 28380 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 43.
The spelling of 30825270306601 in words is "thirty trillion, eight hundred twenty-five billion, two hundred seventy million, three hundred six thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •