Base | Representation |
---|---|
bin | 100110110010000… |
… | …1001010110001111 |
3 | 10100200122221221220 |
4 | 1031210021112033 |
5 | 10131114233403 |
6 | 333043454423 |
7 | 44151022035 |
oct | 11544112617 |
9 | 3320587856 |
10 | 1301321103 |
11 | 60861a895 |
12 | 303987413 |
13 | 1797ab3b4 |
14 | c4b86555 |
15 | 793a1953 |
hex | 4d90958f |
1301321103 has 4 divisors (see below), whose sum is σ = 1735094808. Its totient is φ = 867547400.
The previous prime is 1301321059. The next prime is 1301321111. The reversal of 1301321103 is 3011231031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3011231031 = 3 ⋅1003743677.
It is a cyclic number.
It is not a de Polignac number, because 1301321103 - 28 = 1301320847 is a prime.
It is a super-2 number, since 2×13013211032 = 3386873226226273218, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1301321143) 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, 216886848 + ... + 216886853.
It is an arithmetic number, because the mean of its divisors is an integer number (433773702).
Almost surely, 21301321103 is an apocalyptic number.
1301321103 is a deficient number, since it is larger than the sum of its proper divisors (433773705).
1301321103 is an equidigital number, since it uses as much as digits as its factorization.
1301321103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 433773704.
The product of its (nonzero) digits is 54, while the sum is 15.
The square root of 1301321103 is about 36073.8285048870. The cubic root of 1301321103 is about 1091.7624610795.
Adding to 1301321103 its reverse (3011231031), we get a palindrome (4312552134).
The spelling of 1301321103 in words is "one billion, three hundred one million, three hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •