Base | Representation |
---|---|
bin | 100001001000111… |
… | …1100110111000101 |
3 | 2212111102112221212 |
4 | 1002101330313011 |
5 | 4234133030424 |
6 | 302202021205 |
7 | 36361601210 |
oct | 10221746705 |
9 | 2774375855 |
10 | 1112001989 |
11 | 52077260a |
12 | 2704a7805 |
13 | 1494c3857 |
14 | a7984777 |
15 | 6795710e |
hex | 4247cdc5 |
1112001989 has 4 divisors (see below), whose sum is σ = 1270859424. Its totient is φ = 953144556.
The previous prime is 1112001983. The next prime is 1112002007. The reversal of 1112001989 is 9891002111.
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: 9891002111 = 397 ⋅24914363.
It is a de Polignac number, because none of the positive numbers 2k-1112001989 is a prime.
It is a super-2 number, since 2×11120019892 = 2473096847079912242, 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 (1112001983) 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, 79428707 + ... + 79428720.
It is an arithmetic number, because the mean of its divisors is an integer number (317714856).
Almost surely, 21112001989 is an apocalyptic number.
It is an amenable number.
1112001989 is a deficient number, since it is larger than the sum of its proper divisors (158857435).
1112001989 is an equidigital number, since it uses as much as digits as its factorization.
1112001989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158857434.
The product of its (nonzero) digits is 1296, while the sum is 32.
The square root of 1112001989 is about 33346.6938241260. The cubic root of 1112001989 is about 1036.0209111748.
The spelling of 1112001989 in words is "one billion, one hundred twelve million, one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •