Base | Representation |
---|---|
bin | 1011010100101101011110… |
… | …0110011110011011011000 |
3 | 1122002020202001010102021101 |
4 | 2311023113212132123120 |
5 | 3112441441144130402 |
6 | 42251352155521144 |
7 | 2423341215231535 |
oct | 265132746363330 |
9 | 48066661112241 |
10 | 12450432411352 |
11 | 3a70220572301 |
12 | 1490b887591b4 |
13 | 6c40bc549940 |
14 | 310865ab1d8c |
15 | 168ce7125b87 |
hex | b52d799e6d8 |
12450432411352 has 64 divisors (see below), whose sum is σ = 25325762958720. Its totient is φ = 5703967531008.
The previous prime is 12450432411317. The next prime is 12450432411421. The reversal of 12450432411352 is 25311423405421.
It is a congruent number.
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, 247562353 + ... + 247612639.
It is an arithmetic number, because the mean of its divisors is an integer number (395715046230).
Almost surely, 212450432411352 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12450432411352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12662881479360).
12450432411352 is an abundant number, since it is smaller than the sum of its proper divisors (12875330547368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12450432411352 is a wasteful number, since it uses less digits than its factorization.
12450432411352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67820 (or 67816 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 37.
Adding to 12450432411352 its reverse (25311423405421), we get a palindrome (37761855816773).
The spelling of 12450432411352 in words is "twelve trillion, four hundred fifty billion, four hundred thirty-two million, four hundred eleven thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •