Base | Representation |
---|---|
bin | 10110011011011001… |
… | …01100100000000000 |
3 | 1011002011020012000000 |
4 | 23031230230200000 |
5 | 144124442333410 |
6 | 5310452000000 |
7 | 604246434234 |
oct | 131554544000 |
9 | 34064205000 |
10 | 12040980480 |
11 | 5119901941 |
12 | 2400600000 |
13 | 119b7b2729 |
14 | 8232485c4 |
15 | 4a7167dc0 |
hex | 2cdb2c800 |
12040980480 has 336 divisors, whose sum is σ = 43343986140. Its totient is φ = 3208937472.
The previous prime is 12040980449. The next prime is 12040980563. The reversal of 12040980480 is 8408904021.
It can be written as a sum of positive squares in 2 ways, for example, as 12040233984 + 746496 = 109728^2 + 864^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
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 27 ways as a sum of consecutive naturals, for example, 7464154 + ... + 7465766.
Almost surely, 212040980480 is an apocalyptic number.
12040980480 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 12040980480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21671993070).
12040980480 is an abundant number, since it is smaller than the sum of its proper divisors (31303005660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12040980480 is an frugal number, since it uses more digits than its factorization.
12040980480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1658 (or 1623 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 36.
The spelling of 12040980480 in words is "twelve billion, forty million, nine hundred eighty thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •