Base | Representation |
---|---|
bin | 100001011000110… |
… | …1010101011000101 |
3 | 2220002001221202221 |
4 | 1002301222223011 |
5 | 4243300103401 |
6 | 303100132341 |
7 | 36522346462 |
oct | 10261525305 |
9 | 2802057687 |
10 | 1120316101 |
11 | 525431083 |
12 | 2732370b1 |
13 | 14b144c48 |
14 | a8b0a669 |
15 | 6854a7a1 |
hex | 42c6aac5 |
1120316101 has 4 divisors (see below), whose sum is σ = 1120537600. Its totient is φ = 1120094604.
The previous prime is 1120316063. The next prime is 1120316117. The reversal of 1120316101 is 1016130211.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1016130211 = 12149 ⋅83639.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1120316101 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 (1120316191) 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, 102981 + ... + 113338.
It is an arithmetic number, because the mean of its divisors is an integer number (280134400).
Almost surely, 21120316101 is an apocalyptic number.
It is an amenable number.
1120316101 is a deficient number, since it is larger than the sum of its proper divisors (221499).
1120316101 is an equidigital number, since it uses as much as digits as its factorization.
1120316101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 221498.
The product of its (nonzero) digits is 36, while the sum is 16.
The square root of 1120316101 is about 33471.1233901702. The cubic root of 1120316101 is about 1038.5965107385.
Adding to 1120316101 its reverse (1016130211), we get a palindrome (2136446312).
The spelling of 1120316101 in words is "one billion, one hundred twenty million, three hundred sixteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •