Base | Representation |
---|---|
bin | 101000000010001… |
… | …0111010000001111 |
3 | 10110121200210010110 |
4 | 1100010113100033 |
5 | 10222342233403 |
6 | 341144011103 |
7 | 45201020025 |
oct | 12004272017 |
9 | 3417623113 |
10 | 1343321103 |
11 | 62a2a7033 |
12 | 315a60a93 |
13 | 1853c5377 |
14 | ca59a715 |
15 | 7cdeb103 |
hex | 5011740f |
1343321103 has 4 divisors (see below), whose sum is σ = 1791094808. Its totient is φ = 895547400.
The previous prime is 1343321101. The next prime is 1343321117. The reversal of 1343321103 is 3011233431.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3011233431 = 3 ⋅1003744477.
It is not a de Polignac number, because 1343321103 - 21 = 1343321101 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1343321103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1343321101) 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, 223886848 + ... + 223886853.
It is an arithmetic number, because the mean of its divisors is an integer number (447773702).
Almost surely, 21343321103 is an apocalyptic number.
1343321103 is a deficient number, since it is larger than the sum of its proper divisors (447773705).
1343321103 is an equidigital number, since it uses as much as digits as its factorization.
1343321103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 447773704.
The product of its (nonzero) digits is 648, while the sum is 21.
The square root of 1343321103 is about 36651.3451731311. The cubic root of 1343321103 is about 1103.3838232499.
Adding to 1343321103 its reverse (3011233431), we get a palindrome (4354554534).
The spelling of 1343321103 in words is "one billion, three hundred forty-three million, three hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •