Base | Representation |
---|---|
bin | 101000000100101… |
… | …0101100111110101 |
3 | 10110201011000221011 |
4 | 1100021111213311 |
5 | 10223211001031 |
6 | 341231552221 |
7 | 45215060626 |
oct | 12011254765 |
9 | 3421130834 |
10 | 1344625141 |
11 | 630007852 |
12 | 31638b671 |
13 | 185760aa2 |
14 | ca819a4d |
15 | 7d0a76b1 |
hex | 502559f5 |
1344625141 has 8 divisors (see below), whose sum is σ = 1352414144. Its totient is φ = 1336849920.
The previous prime is 1344625129. The next prime is 1344625153. The reversal of 1344625141 is 1415264431.
It is an interprime number because it is at equal distance from previous prime (1344625129) and next prime (1344625153).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1344625141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1344625111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 240520 + ... + 246046.
It is an arithmetic number, because the mean of its divisors is an integer number (169051768).
Almost surely, 21344625141 is an apocalyptic number.
It is an amenable number.
1344625141 is a deficient number, since it is larger than the sum of its proper divisors (7789003).
1344625141 is a wasteful number, since it uses less digits than its factorization.
1344625141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6891.
The product of its digits is 11520, while the sum is 31.
The square root of 1344625141 is about 36669.1306278183. The cubic root of 1344625141 is about 1103.7407468698.
Adding to 1344625141 its reverse (1415264431), we get a palindrome (2759889572).
The spelling of 1344625141 in words is "one billion, three hundred forty-four million, six hundred twenty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •