Base | Representation |
---|---|
bin | 10110010010111011… |
… | …11101101111100000 |
3 | 1010220012200111220200 |
4 | 23021131331233200 |
5 | 144003310310310 |
6 | 5255434505200 |
7 | 602425256400 |
oct | 131135755740 |
9 | 33805614820 |
10 | 11970010080 |
11 | 5092838816 |
12 | 23a0895200 |
13 | 1189b94302 |
14 | 817a52800 |
15 | 4a0ce99c0 |
hex | 2c977dbe0 |
11970010080 has 648 divisors, whose sum is σ = 50562170568. Its totient is φ = 2570674176.
The previous prime is 11970009979. The next prime is 11970010133. The reversal of 11970010080 is 8001007911.
It is a super-2 number, since 2×119700100802 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 107 ways as a sum of consecutive naturals, for example, 20391547 + ... + 20392133.
It is an arithmetic number, because the mean of its divisors is an integer number (78028041).
Almost surely, 211970010080 is an apocalyptic number.
11970010080 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 11970010080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25281085284).
11970010080 is an abundant number, since it is smaller than the sum of its proper divisors (38592160488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11970010080 is a wasteful number, since it uses less digits than its factorization.
11970010080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 656 (or 621 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 27.
Adding to 11970010080 its reverse (8001007911), we get a palindrome (19971017991).
The spelling of 11970010080 in words is "eleven billion, nine hundred seventy million, ten thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •