Base | Representation |
---|---|
bin | 100111010101111… |
… | …0110111111110111 |
3 | 10102000001001121212 |
4 | 1032223312333313 |
5 | 10200422322221 |
6 | 334554432035 |
7 | 44466560156 |
oct | 11653667767 |
9 | 3360031555 |
10 | 1320120311 |
11 | 61819aa24 |
12 | 30a13261b |
13 | 1806610a3 |
14 | c747b59d |
15 | 7ad66b5b |
hex | 4eaf6ff7 |
1320120311 has 4 divisors (see below), whose sum is σ = 1332457992. Its totient is φ = 1307782632.
The previous prime is 1320120287. The next prime is 1320120317. The reversal of 1320120311 is 1130210231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1130210231 = 19 ⋅59484749.
It is a cyclic number.
It is not a de Polignac number, because 1320120311 - 210 = 1320119287 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1320120317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6168680 + ... + 6168893.
It is an arithmetic number, because the mean of its divisors is an integer number (333114498).
Almost surely, 21320120311 is an apocalyptic number.
1320120311 is a deficient number, since it is larger than the sum of its proper divisors (12337681).
1320120311 is a wasteful number, since it uses less digits than its factorization.
1320120311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12337680.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 1320120311 is about 36333.4599370883. The cubic root of 1320120311 is about 1096.9946368761.
Adding to 1320120311 its reverse (1130210231), we get a palindrome (2450330542).
The spelling of 1320120311 in words is "one billion, three hundred twenty million, one hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •