Base | Representation |
---|---|
bin | 11010011110000111… |
… | …10100101111111001 |
3 | 1100200102002001202221 |
4 | 31033003310233321 |
5 | 213101043220231 |
6 | 10310101324041 |
7 | 1012112044315 |
oct | 151703645771 |
9 | 40612061687 |
10 | 14211304441 |
11 | 6032a02404 |
12 | 2907406621 |
13 | 14563236a9 |
14 | 98b59cb45 |
15 | 582971d11 |
hex | 34f0f4bf9 |
14211304441 has 4 divisors (see below), whose sum is σ = 14213012112. Its totient is φ = 14209596772.
The previous prime is 14211304439. The next prime is 14211304447. The reversal of 14211304441 is 14440311241.
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, and also an emirpimes, since its reverse is a distinct semiprime: 14440311241 = 17 ⋅849430073.
It is a cyclic number.
It is not a de Polignac number, because 14211304441 - 21 = 14211304439 is a prime.
It is a super-2 number, since 2×142113044412 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14211304447) 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, 841291 + ... + 858016.
It is an arithmetic number, because the mean of its divisors is an integer number (3553253028).
Almost surely, 214211304441 is an apocalyptic number.
It is an amenable number.
14211304441 is a deficient number, since it is larger than the sum of its proper divisors (1707671).
14211304441 is an equidigital number, since it uses as much as digits as its factorization.
14211304441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1707670.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 14211304441 its reverse (14440311241), we get a palindrome (28651615682).
The spelling of 14211304441 in words is "fourteen billion, two hundred eleven million, three hundred four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •