Base | Representation |
---|---|
bin | 101000000010001… |
… | …0101101000011101 |
3 | 10110121200110000110 |
4 | 1100010111220131 |
5 | 10222342030321 |
6 | 341143520233 |
7 | 45200661456 |
oct | 12004255035 |
9 | 3417613013 |
10 | 1343314461 |
11 | 62a2a2045 |
12 | 315a59079 |
13 | 1853c2338 |
14 | ca59812d |
15 | 7cde9176 |
hex | 50115a1d |
1343314461 has 4 divisors (see below), whose sum is σ = 1791085952. Its totient is φ = 895542972.
The previous prime is 1343314439. The next prime is 1343314477. The reversal of 1343314461 is 1644133431.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1343314461 - 213 = 1343306269 is a prime.
It is a super-2 number, since 2×13433144612 = 3608987482263441042, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1343314061) 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, 223885741 + ... + 223885746.
It is an arithmetic number, because the mean of its divisors is an integer number (447771488).
Almost surely, 21343314461 is an apocalyptic number.
It is an amenable number.
1343314461 is a deficient number, since it is larger than the sum of its proper divisors (447771491).
1343314461 is an equidigital number, since it uses as much as digits as its factorization.
1343314461 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 447771490.
The product of its digits is 10368, while the sum is 30.
The square root of 1343314461 is about 36651.2545624294. The cubic root of 1343314461 is about 1103.3820047005.
Adding to 1343314461 its reverse (1644133431), we get a palindrome (2987447892).
The spelling of 1343314461 in words is "one billion, three hundred forty-three million, three hundred fourteen thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •