Base | Representation |
---|---|
bin | 101000000011101… |
… | …0101011110000111 |
3 | 10110200011100220001 |
4 | 1100013111132013 |
5 | 10223042201411 |
6 | 341212422131 |
7 | 45210443365 |
oct | 12007253607 |
9 | 3420140801 |
10 | 1344100231 |
11 | 62a789441 |
12 | 316177947 |
13 | 185608ba6 |
14 | ca720635 |
15 | 7d001dc1 |
hex | 501d5787 |
1344100231 has 4 divisors (see below), whose sum is σ = 1349455464. Its totient is φ = 1338745000.
The previous prime is 1344100213. The next prime is 1344100259. The reversal of 1344100231 is 1320014431.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1344100231 - 225 = 1310545799 is a prime.
It is a super-2 number, since 2×13441002312 = 3613210861948506722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1344100199 and 1344100208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1344100931) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2677240 + ... + 2677741.
It is an arithmetic number, because the mean of its divisors is an integer number (337363866).
Almost surely, 21344100231 is an apocalyptic number.
1344100231 is a deficient number, since it is larger than the sum of its proper divisors (5355233).
1344100231 is an equidigital number, since it uses as much as digits as its factorization.
1344100231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5355232.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 1344100231 is about 36661.9725464956. The cubic root of 1344100231 is about 1103.5971033754.
Adding to 1344100231 its reverse (1320014431), we get a palindrome (2664114662).
The spelling of 1344100231 in words is "one billion, three hundred forty-four million, one hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •