Base | Representation |
---|---|
bin | 101000000011111… |
… | …0011101110001001 |
3 | 10110200101122212011 |
4 | 1100013303232021 |
5 | 10223110133022 |
6 | 341215215521 |
7 | 45211500544 |
oct | 12007635611 |
9 | 3420348764 |
10 | 1344224137 |
11 | 62a863543 |
12 | 3162175a1 |
13 | 1856503c9 |
14 | ca75385b |
15 | 7d028977 |
hex | 501f3b89 |
1344224137 has 2 divisors, whose sum is σ = 1344224138. Its totient is φ = 1344224136.
The previous prime is 1344224131. The next prime is 1344224173. The reversal of 1344224137 is 7314224431.
Together with next prime (1344224173) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1071842121 + 272382016 = 32739^2 + 16504^2 .
It is a cyclic number.
It is not a de Polignac number, because 1344224137 - 27 = 1344224009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1344224099 and 1344224108.
It is not a weakly prime, because it can be changed into another prime (1344224131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 672112068 + 672112069.
It is an arithmetic number, because the mean of its divisors is an integer number (672112069).
Almost surely, 21344224137 is an apocalyptic number.
It is an amenable number.
1344224137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1344224137 is an equidigital number, since it uses as much as digits as its factorization.
1344224137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 16128, while the sum is 31.
The square root of 1344224137 is about 36663.6623511618. The cubic root of 1344224137 is about 1103.6310140659.
Adding to 1344224137 its reverse (7314224431), we get a palindrome (8658448568).
The spelling of 1344224137 in words is "one billion, three hundred forty-four million, two hundred twenty-four thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •