Base | Representation |
---|---|
bin | 111001011011… |
… | …0000000111101 |
3 | 2002122112012111 |
4 | 1302312000331 |
5 | 30201340121 |
6 | 2553134021 |
7 | 513615415 |
oct | 162660075 |
9 | 62575174 |
10 | 30105661 |
11 | 15aa2913 |
12 | a0ba311 |
13 | 6311101 |
14 | 3dd9645 |
15 | 299a2e1 |
hex | 1cb603d |
30105661 has 4 divisors (see below), whose sum is σ = 30217024. Its totient is φ = 29994300.
The previous prime is 30105653. The next prime is 30105707. The reversal of 30105661 is 16650103.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 16650103 = 67 ⋅248509.
It is a cyclic number.
It is not a de Polignac number, because 30105661 - 23 = 30105653 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30105601) 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 in 3 ways as a sum of consecutive naturals, for example, 55275 + ... + 55816.
It is an arithmetic number, because the mean of its divisors is an integer number (7554256).
Almost surely, 230105661 is an apocalyptic number.
It is an amenable number.
30105661 is a deficient number, since it is larger than the sum of its proper divisors (111363).
30105661 is a wasteful number, since it uses less digits than its factorization.
30105661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111362.
The product of its (nonzero) digits is 540, while the sum is 22.
The square root of 30105661 is about 5486.8625825694. The cubic root of 30105661 is about 311.0876157096.
Adding to 30105661 its reverse (16650103), we get a palindrome (46755764).
The spelling of 30105661 in words is "thirty million, one hundred five thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •