Base | Representation |
---|---|
bin | 100001011011000… |
… | …1100001110010001 |
3 | 2220011022012122201 |
4 | 1002312030032101 |
5 | 4244101031342 |
6 | 303141403201 |
7 | 36535416262 |
oct | 10266141621 |
9 | 2804265581 |
10 | 1121502097 |
11 | 526071141 |
12 | 273709501 |
13 | 14b46ba11 |
14 | a8d38969 |
15 | 686d1db7 |
hex | 42d8c391 |
1121502097 has 4 divisors (see below), whose sum is σ = 1157679616. Its totient is φ = 1085324580.
The previous prime is 1121502043. The next prime is 1121502133. The reversal of 1121502097 is 7902051211.
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: 7902051211 = 1439 ⋅5491349.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1121502097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1121502497) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18088713 + ... + 18088774.
It is an arithmetic number, because the mean of its divisors is an integer number (289419904).
Almost surely, 21121502097 is an apocalyptic number.
It is an amenable number.
1121502097 is a deficient number, since it is larger than the sum of its proper divisors (36177519).
1121502097 is an equidigital number, since it uses as much as digits as its factorization.
1121502097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36177518.
The product of its (nonzero) digits is 1260, while the sum is 28.
The square root of 1121502097 is about 33488.8354082372. The cubic root of 1121502097 is about 1038.9628766537.
The spelling of 1121502097 in words is "one billion, one hundred twenty-one million, five hundred two thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •