Base | Representation |
---|---|
bin | 10110100110001100… |
… | …11001000010000000 |
3 | 1011022110202021010100 |
4 | 23103012121002000 |
5 | 144321142240220 |
6 | 5323450202400 |
7 | 606426630450 |
oct | 132306310200 |
9 | 34273667110 |
10 | 12131602560 |
11 | 5165a78620 |
12 | 2426a23400 |
13 | 11b44c186c |
14 | 8312b7d60 |
15 | 4b00b8d90 |
hex | 2d3199080 |
12131602560 has 768 divisors, whose sum is σ = 55335571200. Its totient is φ = 2371092480.
The previous prime is 12131602501. The next prime is 12131602579. The reversal of 12131602560 is 6520613121.
12131602560 is a `hidden beast` number, since 1 + 2 + 1 + 3 + 1 + 602 + 56 + 0 = 666.
It is a super-3 number, since 3×121316025603 (a number of 31 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 7539036 + ... + 7540644.
It is an arithmetic number, because the mean of its divisors is an integer number (72051525).
Almost surely, 212131602560 is an apocalyptic number.
12131602560 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 12131602560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27667785600).
12131602560 is an abundant number, since it is smaller than the sum of its proper divisors (43203968640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12131602560 is a wasteful number, since it uses less digits than its factorization.
12131602560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1669 (or 1654 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The spelling of 12131602560 in words is "twelve billion, one hundred thirty-one million, six hundred two thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •