Base | Representation |
---|---|
bin | 11100110111011000… |
… | …000110101001110101 |
3 | 2222000000101000222100 |
4 | 130313120012221311 |
5 | 1001433410233121 |
6 | 22123253252313 |
7 | 2145025156554 |
oct | 346730065165 |
9 | 88000330870 |
10 | 30993836661 |
11 | 12165238247 |
12 | 600b934099 |
13 | 2bcc254b28 |
14 | 170042dd9b |
15 | c15ede026 |
hex | 737606a75 |
30993836661 has 12 divisors (see below), whose sum is σ = 44895703788. Its totient is φ = 20604021504.
The previous prime is 30993836593. The next prime is 30993836707. The reversal of 30993836661 is 16663839903.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 12073834161 + 18920002500 = 109881^2 + 137550^2 .
It is not a de Polignac number, because 30993836661 - 233 = 22403902069 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 30993836598 and 30993836607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30993836261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4874670 + ... + 4881023.
It is an arithmetic number, because the mean of its divisors is an integer number (3741308649).
Almost surely, 230993836661 is an apocalyptic number.
It is an amenable number.
30993836661 is a deficient number, since it is larger than the sum of its proper divisors (13901867127).
30993836661 is a wasteful number, since it uses less digits than its factorization.
30993836661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9756052 (or 9756049 counting only the distinct ones).
The product of its (nonzero) digits is 3779136, while the sum is 54.
The spelling of 30993836661 in words is "thirty billion, nine hundred ninety-three million, eight hundred thirty-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •