Base | Representation |
---|---|
bin | 11001000010001011… |
… | …11011001011100101 |
3 | 1021200122220222110211 |
4 | 30201011323023211 |
5 | 210011131300031 |
6 | 10101352015421 |
7 | 654025664113 |
oct | 144105731345 |
9 | 37618828424 |
10 | 13440103141 |
11 | 5777651463 |
12 | 2731091571 |
13 | 1362614a6a |
14 | 916dacab3 |
15 | 539dd7bb1 |
hex | 32117b2e5 |
13440103141 has 2 divisors, whose sum is σ = 13440103142. Its totient is φ = 13440103140.
The previous prime is 13440103129. The next prime is 13440103249. The reversal of 13440103141 is 14130104431.
It is a happy number.
13440103141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11562700900 + 1877402241 = 107530^2 + 43329^2 .
It is a cyclic number.
It is not a de Polignac number, because 13440103141 - 27 = 13440103013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13440103741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6720051570 + 6720051571.
It is an arithmetic number, because the mean of its divisors is an integer number (6720051571).
Almost surely, 213440103141 is an apocalyptic number.
It is an amenable number.
13440103141 is a deficient number, since it is larger than the sum of its proper divisors (1).
13440103141 is an equidigital number, since it uses as much as digits as its factorization.
13440103141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 13440103141 its reverse (14130104431), we get a palindrome (27570207572).
The spelling of 13440103141 in words is "thirteen billion, four hundred forty million, one hundred three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •