Base | Representation |
---|---|
bin | 1011011010001011100110… |
… | …1110101110111101010011 |
3 | 1122102020100020101001202011 |
4 | 2312202321232232331103 |
5 | 3121011433124241433 |
6 | 42402454403403351 |
7 | 2433206302160164 |
oct | 266427156567523 |
9 | 48366306331664 |
10 | 12544420540243 |
11 | 3aa70713a9689 |
12 | 14a7239083557 |
13 | 6ccc1a6951a7 |
14 | 31522051376b |
15 | 16b4986803cd |
hex | b68b9baef53 |
12544420540243 has 8 divisors (see below), whose sum is σ = 12547138223936. Its totient is φ = 12541703169600.
The previous prime is 12544420540229. The next prime is 12544420540343. The reversal of 12544420540243 is 34204502444521.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12544420540243 - 213 = 12544420532051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12544420540196 and 12544420540205.
It is not an unprimeable number, because it can be changed into a prime (12544420540213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91221205 + ... + 91358617.
It is an arithmetic number, because the mean of its divisors is an integer number (1568392277992).
Almost surely, 212544420540243 is an apocalyptic number.
12544420540243 is a deficient number, since it is larger than the sum of its proper divisors (2717683693).
12544420540243 is an equidigital number, since it uses as much as digits as its factorization.
12544420540243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156525.
The product of its (nonzero) digits is 614400, while the sum is 40.
Adding to 12544420540243 its reverse (34204502444521), we get a palindrome (46748922984764).
The spelling of 12544420540243 in words is "twelve trillion, five hundred forty-four billion, four hundred twenty million, five hundred forty thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •