Base | Representation |
---|---|
bin | 100001011010100… |
… | …0101111001011001 |
3 | 2220010202120111222 |
4 | 1002311011321121 |
5 | 4244012322131 |
6 | 303131301425 |
7 | 36533106413 |
oct | 10265057131 |
9 | 2803676458 |
10 | 1121214041 |
11 | 525994782 |
12 | 2735aa875 |
13 | 14b39a87c |
14 | a8ca19b3 |
15 | 6867687b |
hex | 42d45e59 |
1121214041 has 4 divisors (see below), whose sum is σ = 1124866512. Its totient is φ = 1117561572.
The previous prime is 1121214013. The next prime is 1121214047. The reversal of 1121214041 is 1404121211.
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: 1404121211 = 67 ⋅20957033.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1121214041 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1121214047) 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, 1825775 + ... + 1826388.
It is an arithmetic number, because the mean of its divisors is an integer number (281216628).
Almost surely, 21121214041 is an apocalyptic number.
It is an amenable number.
1121214041 is a deficient number, since it is larger than the sum of its proper divisors (3652471).
1121214041 is an equidigital number, since it uses as much as digits as its factorization.
1121214041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3652470.
The product of its (nonzero) digits is 64, while the sum is 17.
The square root of 1121214041 is about 33484.5343554304. The cubic root of 1121214041 is about 1038.8739170587.
Adding to 1121214041 its reverse (1404121211), we get a palindrome (2525335252).
The spelling of 1121214041 in words is "one billion, one hundred twenty-one million, two hundred fourteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •