Base | Representation |
---|---|
bin | 101000000011110… |
… | …0010001110001101 |
3 | 10110200021000112111 |
4 | 1100013202032031 |
5 | 10223100334321 |
6 | 341213504021 |
7 | 45211051561 |
oct | 12007421615 |
9 | 3420230474 |
10 | 1344152461 |
11 | 62a814703 |
12 | 3161a2011 |
13 | 1856268b2 |
14 | ca7356a1 |
15 | 7d0125e1 |
hex | 501e238d |
1344152461 has 2 divisors, whose sum is σ = 1344152462. Its totient is φ = 1344152460.
The previous prime is 1344152441. The next prime is 1344152479. The reversal of 1344152461 is 1642514431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 782936361 + 561216100 = 27981^2 + 23690^2 .
It is an emirp because it is prime and its reverse (1642514431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1344152461 - 211 = 1344150413 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1344152441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 672076230 + 672076231.
It is an arithmetic number, because the mean of its divisors is an integer number (672076231).
Almost surely, 21344152461 is an apocalyptic number.
It is an amenable number.
1344152461 is a deficient number, since it is larger than the sum of its proper divisors (1).
1344152461 is an equidigital number, since it uses as much as digits as its factorization.
1344152461 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11520, while the sum is 31.
The square root of 1344152461 is about 36662.6848580406. The cubic root of 1344152461 is about 1103.6113979765.
Adding to 1344152461 its reverse (1642514431), we get a palindrome (2986666892).
The spelling of 1344152461 in words is "one billion, three hundred forty-four million, one hundred fifty-two thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •