Base | Representation |
---|---|
bin | 10101101000010011… |
… | …11011100111110100 |
3 | 1002222021211220211112 |
4 | 22310021323213310 |
5 | 142240240440410 |
6 | 5200142454152 |
7 | 560524041254 |
oct | 126411734764 |
9 | 32867756745 |
10 | 11612436980 |
11 | 4a19a10861 |
12 | 2300b94358 |
13 | 1130a890b1 |
14 | 7c2373964 |
15 | 47e717105 |
hex | 2b427b9f4 |
11612436980 has 24 divisors (see below), whose sum is σ = 24660122760. Its totient is φ = 4592783360.
The previous prime is 11612436973. The next prime is 11612437007. The reversal of 11612436980 is 8963421611.
It can be written as a sum of positive squares in 4 ways, for example, as 436141456 + 11176295524 = 20884^2 + 105718^2 .
It is a super-2 number, since 2×116124369802 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 3260141 + ... + 3263700.
It is an arithmetic number, because the mean of its divisors is an integer number (1027505115).
Almost surely, 211612436980 is an apocalyptic number.
11612436980 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11612436980 is an abundant number, since it is smaller than the sum of its proper divisors (13047685780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11612436980 is a wasteful number, since it uses less digits than its factorization.
11612436980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6523939 (or 6523937 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 41.
The spelling of 11612436980 in words is "eleven billion, six hundred twelve million, four hundred thirty-six thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •