Base | Representation |
---|---|
bin | 1101101000111011… |
… | …0101111101101000 |
3 | 100110011102112111122 |
4 | 3122032311331220 |
5 | 24444244333021 |
6 | 1403150514412 |
7 | 156505512251 |
oct | 33216657550 |
9 | 10404375448 |
10 | 3661324136 |
11 | 16097a4018 |
12 | 862205a08 |
13 | 4647019b2 |
14 | 26a393b28 |
15 | 166676bab |
hex | da3b5f68 |
3661324136 has 16 divisors (see below), whose sum is σ = 7268805540. Its totient is φ = 1722976000.
The previous prime is 3661324133. The next prime is 3661324151. The reversal of 3661324136 is 6314231663.
It can be written as a sum of positive squares in 2 ways, for example, as 3660976036 + 348100 = 60506^2 + 590^2 .
It is a super-2 number, since 2×36613241362 = 26810588857712292992, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3661324096 and 3661324105.
It is not an unprimeable number, because it can be changed into a prime (3661324133) 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, 13460615 + ... + 13460886.
Almost surely, 23661324136 is an apocalyptic number.
It is an amenable number.
3661324136 is a deficient number, since it is larger than the sum of its proper divisors (3607481404).
3661324136 is a wasteful number, since it uses less digits than its factorization.
3661324136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26921524 (or 26921520 counting only the distinct ones).
The product of its digits is 46656, while the sum is 35.
The square root of 3661324136 is about 60508.8765058483. The cubic root of 3661324136 is about 1541.2723694989.
Adding to 3661324136 its reverse (6314231663), we get a palindrome (9975555799).
The spelling of 3661324136 in words is "three billion, six hundred sixty-one million, three hundred twenty-four thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •