Base | Representation |
---|---|
bin | 10111001010000000… |
… | …10101001111001001 |
3 | 1012002102000020111010 |
4 | 23211000111033021 |
5 | 200430043112131 |
6 | 5413340554133 |
7 | 620035201512 |
oct | 134500251711 |
9 | 35072006433 |
10 | 12432004041 |
11 | 52aa5a6706 |
12 | 24ab552949 |
13 | 1231800312 |
14 | 85d153a09 |
15 | 4cb656b46 |
hex | 2e50153c9 |
12432004041 has 4 divisors (see below), whose sum is σ = 16576005392. Its totient is φ = 8288002692.
The previous prime is 12432004009. The next prime is 12432004073. The reversal of 12432004041 is 14040023421.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (12432004009) and next prime (12432004073).
It is not a de Polignac number, because 12432004041 - 25 = 12432004009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12432003999 and 12432004017.
It is not an unprimeable number, because it can be changed into a prime (12432004141) 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, 2072000671 + ... + 2072000676.
It is an arithmetic number, because the mean of its divisors is an integer number (4144001348).
Almost surely, 212432004041 is an apocalyptic number.
It is an amenable number.
12432004041 is a deficient number, since it is larger than the sum of its proper divisors (4144001351).
12432004041 is an equidigital number, since it uses as much as digits as its factorization.
12432004041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4144001350.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 12432004041 its reverse (14040023421), we get a palindrome (26472027462).
The spelling of 12432004041 in words is "twelve billion, four hundred thirty-two million, four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •