Base | Representation |
---|---|
bin | 101000000011111… |
… | …0101101101101101 |
3 | 10110200102002001112 |
4 | 1100013311231231 |
5 | 10223110413201 |
6 | 341215321405 |
7 | 45211533416 |
oct | 12007655555 |
9 | 3420362045 |
10 | 1344232301 |
11 | 62a869695 |
12 | 316220265 |
13 | 185654039 |
14 | ca75680d |
15 | 7d02b0bb |
hex | 501f5b6d |
1344232301 has 2 divisors, whose sum is σ = 1344232302. Its totient is φ = 1344232300.
The previous prime is 1344232291. The next prime is 1344232303. The reversal of 1344232301 is 1032324431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 919666276 + 424566025 = 30326^2 + 20605^2 .
It is a cyclic number.
It is not a de Polignac number, because 1344232301 - 210 = 1344231277 is a prime.
Together with 1344232303, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1344232303) 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, 672116150 + 672116151.
It is an arithmetic number, because the mean of its divisors is an integer number (672116151).
Almost surely, 21344232301 is an apocalyptic number.
It is an amenable number.
1344232301 is a deficient number, since it is larger than the sum of its proper divisors (1).
1344232301 is an equidigital number, since it uses as much as digits as its factorization.
1344232301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 23.
The square root of 1344232301 is about 36663.7736873879. The cubic root of 1344232301 is about 1103.6332483226.
Adding to 1344232301 its reverse (1032324431), we get a palindrome (2376556732).
The spelling of 1344232301 in words is "one billion, three hundred forty-four million, two hundred thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •