Base | Representation |
---|---|
bin | 1101011101000101… |
… | …1110001101100100 |
3 | 100022201000102210112 |
4 | 3113101132031210 |
5 | 24344042303021 |
6 | 1354214512152 |
7 | 155333534033 |
oct | 32721361544 |
9 | 10281012715 |
10 | 3611681636 |
11 | 1593777962 |
12 | 849665658 |
13 | 457340234 |
14 | 26395071a |
15 | 16211cd5b |
hex | d745e364 |
3611681636 has 12 divisors (see below), whose sum is σ = 6474600300. Its totient is φ = 1761795840.
The previous prime is 3611681621. The next prime is 3611681639. The reversal of 3611681636 is 6361861163.
It can be written as a sum of positive squares in 2 ways, for example, as 789947236 + 2821734400 = 28106^2 + 53120^2 .
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a junction number, because it is equal to n+sod(n) for n = 3611681593 and 3611681602.
It is not an unprimeable number, because it can be changed into a prime (3611681639) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11011061 + ... + 11011388.
It is an arithmetic number, because the mean of its divisors is an integer number (539550025).
Almost surely, 23611681636 is an apocalyptic number.
It is an amenable number.
3611681636 is a deficient number, since it is larger than the sum of its proper divisors (2862918664).
3611681636 is a wasteful number, since it uses less digits than its factorization.
3611681636 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22022494 (or 22022492 counting only the distinct ones).
The product of its digits is 93312, while the sum is 41.
The square root of 3611681636 is about 60097.2681242667. The cubic root of 3611681636 is about 1534.2748060397.
The spelling of 3611681636 in words is "three billion, six hundred eleven million, six hundred eighty-one thousand, six hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •