Base | Representation |
---|---|
bin | 11001000010001100… |
… | …00010110100000001 |
3 | 1021200122222120100121 |
4 | 30201012002310001 |
5 | 210011133300101 |
6 | 10101352420241 |
7 | 654026154211 |
oct | 144106026401 |
9 | 37618876317 |
10 | 13440134401 |
11 | 57776729a1 |
12 | 27310a7681 |
13 | 1362626065 |
14 | 916dba241 |
15 | 539de20a1 |
hex | 321182d01 |
13440134401 has 4 divisors (see below), whose sum is σ = 13440416704. Its totient is φ = 13439852100.
The previous prime is 13440134381. The next prime is 13440134417. The reversal of 13440134401 is 10443104431.
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: 10443104431 = 1117 ⋅9349243.
It is a cyclic number.
It is not a de Polignac number, because 13440134401 - 217 = 13440003329 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13440134441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50205 + ... + 171466.
It is an arithmetic number, because the mean of its divisors is an integer number (3360104176).
Almost surely, 213440134401 is an apocalyptic number.
It is an amenable number.
13440134401 is a deficient number, since it is larger than the sum of its proper divisors (282303).
13440134401 is an equidigital number, since it uses as much as digits as its factorization.
13440134401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282302.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 13440134401 its reverse (10443104431), we get a palindrome (23883238832).
The spelling of 13440134401 in words is "thirteen billion, four hundred forty million, one hundred thirty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •