Base | Representation |
---|---|
bin | 10111001011110011… |
… | …00111000000100000 |
3 | 1012010110021002012012 |
4 | 23211321213000200 |
5 | 200442414102130 |
6 | 5415034452052 |
7 | 620306626151 |
oct | 134571470040 |
9 | 35113232165 |
10 | 12447019040 |
11 | 53080216a5 |
12 | 24b4594028 |
13 | 1234959731 |
14 | 861141928 |
15 | 4ccb20995 |
hex | 2e5e67020 |
12447019040 has 96 divisors (see below), whose sum is σ = 30388478400. Its totient is φ = 4814152704.
The previous prime is 12447019031. The next prime is 12447019061. The reversal of 12447019040 is 4091074421.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a junction number, because it is equal to n+sod(n) for n = 12447018988 and 12447019006.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 958511 + ... + 971409.
It is an arithmetic number, because the mean of its divisors is an integer number (316546650).
Almost surely, 212447019040 is an apocalyptic number.
12447019040 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 12447019040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15194239200).
12447019040 is an abundant number, since it is smaller than the sum of its proper divisors (17941459360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12447019040 is a wasteful number, since it uses less digits than its factorization.
12447019040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13114 (or 13106 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 32.
The spelling of 12447019040 in words is "twelve billion, four hundred forty-seven million, nineteen thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •