Base | Representation |
---|---|
bin | 100001110101100000… |
… | …111011111010100101 |
3 | 10110202222202121100102 |
4 | 201311200323322211 |
5 | 1043401303303121 |
6 | 24405041553445 |
7 | 2424216003566 |
oct | 416540737245 |
9 | 113688677312 |
10 | 36331306661 |
11 | 14454091481 |
12 | 705b345885 |
13 | 356cca05c0 |
14 | 1a8925a16d |
15 | e298a690b |
hex | 87583bea5 |
36331306661 has 4 divisors (see below), whose sum is σ = 39126022572. Its totient is φ = 33536590752.
The previous prime is 36331306657. The next prime is 36331306751. The reversal of 36331306661 is 16660313363.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 16660313363 = 331 ⋅50333273.
It can be written as a sum of positive squares in 2 ways, for example, as 2904132100 + 33427174561 = 53890^2 + 182831^2 .
It is a cyclic number.
It is not a de Polignac number, because 36331306661 - 22 = 36331306657 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (36331306061) 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 3 ways as a sum of consecutive naturals, for example, 1397357936 + ... + 1397357961.
It is an arithmetic number, because the mean of its divisors is an integer number (9781505643).
Almost surely, 236331306661 is an apocalyptic number.
It is an amenable number.
36331306661 is a deficient number, since it is larger than the sum of its proper divisors (2794715911).
36331306661 is a wasteful number, since it uses less digits than its factorization.
36331306661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2794715910.
The product of its (nonzero) digits is 104976, while the sum is 38.
The spelling of 36331306661 in words is "thirty-six billion, three hundred thirty-one million, three hundred six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •