Base | Representation |
---|---|
bin | 1011011100110011011100… |
… | …0011011101001100001101 |
3 | 1122120112122000010212020001 |
4 | 2313030313003131030031 |
5 | 3122231220014004303 |
6 | 42435305101524301 |
7 | 2436362605063636 |
oct | 267146703351415 |
9 | 48515560125201 |
10 | 12589472797453 |
11 | 4014190207302 |
12 | 14b3b10b73691 |
13 | 70424a371c56 |
14 | 317495aa688d |
15 | 16c73399231d |
hex | b73370dd30d |
12589472797453 has 4 divisors (see below), whose sum is σ = 12896533109628. Its totient is φ = 12282412485280.
The previous prime is 12589472797439. The next prime is 12589472797459. The reversal of 12589472797453 is 35479727498521.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 237361891204 + 12352110906249 = 487198^2 + 3514557^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12589472797453 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12589472797459) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 153530156026 + ... + 153530156107.
It is an arithmetic number, because the mean of its divisors is an integer number (3224133277407).
Almost surely, 212589472797453 is an apocalyptic number.
It is an amenable number.
12589472797453 is a deficient number, since it is larger than the sum of its proper divisors (307060312175).
12589472797453 is an equidigital number, since it uses as much as digits as its factorization.
12589472797453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 307060312174.
The product of its digits is 1066867200, while the sum is 73.
The spelling of 12589472797453 in words is "twelve trillion, five hundred eighty-nine billion, four hundred seventy-two million, seven hundred ninety-seven thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •