Base | Representation |
---|---|
bin | 1011010011101001101101… |
… | …1101100010011111010111 |
3 | 1122000111210102121100212211 |
4 | 2310322123131202133113 |
5 | 3112142213323112201 |
6 | 42235143245454251 |
7 | 2422125404502514 |
oct | 264723335423727 |
9 | 48014712540784 |
10 | 12432243566551 |
11 | 3a63537426a66 |
12 | 1489551271387 |
13 | 6c2481169693 |
14 | 30da1c16830b |
15 | 1685d03b8651 |
hex | b4e9b7627d7 |
12432243566551 has 4 divisors (see below), whose sum is σ = 12860941620600. Its totient is φ = 12003545512504.
The previous prime is 12432243566549. The next prime is 12432243566557. The reversal of 12432243566551 is 15566534223421.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12432243566551 - 21 = 12432243566549 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12432243566495 and 12432243566504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12432243566557) 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, 214349026981 + ... + 214349027038.
It is an arithmetic number, because the mean of its divisors is an integer number (3215235405150).
Almost surely, 212432243566551 is an apocalyptic number.
12432243566551 is a deficient number, since it is larger than the sum of its proper divisors (428698054049).
12432243566551 is an equidigital number, since it uses as much as digits as its factorization.
12432243566551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428698054048.
The product of its digits is 5184000, while the sum is 49.
Adding to 12432243566551 its reverse (15566534223421), we get a palindrome (27998777789972).
The spelling of 12432243566551 in words is "twelve trillion, four hundred thirty-two billion, two hundred forty-three million, five hundred sixty-six thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •