Base | Representation |
---|---|
bin | 10110010011001010… |
… | …11010010110000000 |
3 | 1010220100100200202220 |
4 | 23021211122112000 |
5 | 144004310242430 |
6 | 5255544411040 |
7 | 602451000000 |
oct | 131145322600 |
9 | 33810320686 |
10 | 11971962240 |
11 | 5093951477 |
12 | 23a1476a80 |
13 | 118a3c8a34 |
14 | 818000000 |
15 | 4a1083110 |
hex | 2c995a580 |
11971962240 has 448 divisors, whose sum is σ = 45360693360. Its totient is φ = 2684817408.
The previous prime is 11971962217. The next prime is 11971962253. The reversal of 11971962240 is 4226917911.
It is a tau number, because it is divible by the number of its divisors (448).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 11971962192 and 11971962201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 225886054 + ... + 225886106.
Almost surely, 211971962240 is an apocalyptic number.
11971962240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11971962240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22680346680).
11971962240 is an abundant number, since it is smaller than the sum of its proper divisors (33388731120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11971962240 is an frugal number, since it uses more digits than its factorization.
11971962240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117 (or 70 counting only the distinct ones).
The product of its (nonzero) digits is 54432, while the sum is 42.
The spelling of 11971962240 in words is "eleven billion, nine hundred seventy-one million, nine hundred sixty-two thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •