Base | Representation |
---|---|
bin | 11100100011111000… |
… | …000000000000110101 |
3 | 2221011012201102101201 |
4 | 130203320000000311 |
5 | 1000301130404444 |
6 | 22031004452501 |
7 | 2133643153534 |
oct | 344370000065 |
9 | 87135642351 |
10 | 30666653749 |
11 | 12007587946 |
12 | 5b3a24a131 |
13 | 2b7952a384 |
14 | 16acbc231b |
15 | be7410dd4 |
hex | 723e00035 |
30666653749 has 2 divisors, whose sum is σ = 30666653750. Its totient is φ = 30666653748.
The previous prime is 30666653737. The next prime is 30666653837. The reversal of 30666653749 is 94735666603.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27164973124 + 3501680625 = 164818^2 + 59175^2 .
It is a cyclic number.
It is not a de Polignac number, because 30666653749 - 225 = 30633099317 is a prime.
It is a super-2 number, since 2×306666537492 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 30666653749.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30666653729) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15333326874 + 15333326875.
It is an arithmetic number, because the mean of its divisors is an integer number (15333326875).
Almost surely, 230666653749 is an apocalyptic number.
It is an amenable number.
30666653749 is a deficient number, since it is larger than the sum of its proper divisors (1).
30666653749 is an equidigital number, since it uses as much as digits as its factorization.
30666653749 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14696640, while the sum is 55.
The spelling of 30666653749 in words is "thirty billion, six hundred sixty-six million, six hundred fifty-three thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •