Base | Representation |
---|---|
bin | 1110110000011010… |
… | …0001010001101000 |
3 | 101020001120100202122 |
4 | 3230012201101220 |
5 | 31103022212021 |
6 | 1453020450412 |
7 | 200106032123 |
oct | 35406412150 |
9 | 11201510678 |
10 | 3961132136 |
11 | 1752a57225 |
12 | 9266a9a08 |
13 | 4b1863290 |
14 | 2981173ba |
15 | 182b48bab |
hex | ec1a1468 |
3961132136 has 64 divisors (see below), whose sum is σ = 8448760320. Its totient is φ = 1728034560.
The previous prime is 3961132121. The next prime is 3961132181. The reversal of 3961132136 is 6312311693.
It is a junction number, because it is equal to n+sod(n) for n = 3961132096 and 3961132105.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 124346 + ... + 152918.
It is an arithmetic number, because the mean of its divisors is an integer number (132011880).
Almost surely, 23961132136 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3961132136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4224380160).
3961132136 is an abundant number, since it is smaller than the sum of its proper divisors (4487628184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3961132136 is a wasteful number, since it uses less digits than its factorization.
3961132136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28666 (or 28662 counting only the distinct ones).
The product of its digits is 17496, while the sum is 35.
The square root of 3961132136 is about 62937.5256583860. The cubic root of 3961132136 is about 1582.2427339641.
The spelling of 3961132136 in words is "three billion, nine hundred sixty-one million, one hundred thirty-two thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •