Base | Representation |
---|---|
bin | 100001011010100… |
… | …1101100010100111 |
3 | 2220010211011110121 |
4 | 1002311031202213 |
5 | 4244014322401 |
6 | 303132102411 |
7 | 36533266612 |
oct | 10265154247 |
9 | 2803734417 |
10 | 1121245351 |
11 | 525a06256 |
12 | 273604a07 |
13 | 14b3abbb5 |
14 | a8cad179 |
15 | 68680ca1 |
hex | 42d4d8a7 |
1121245351 has 4 divisors (see below), whose sum is σ = 1127726712. Its totient is φ = 1114763992.
The previous prime is 1121245337. The next prime is 1121245379. The reversal of 1121245351 is 1535421211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1535421211 = 29 ⋅52945559.
It is a cyclic number.
It is not a de Polignac number, because 1121245351 - 215 = 1121212583 is a prime.
It is a super-2 number, since 2×11212453512 = 2514382274278226402, 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 (1121245451) 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, 3240421 + ... + 3240766.
It is an arithmetic number, because the mean of its divisors is an integer number (281931678).
Almost surely, 21121245351 is an apocalyptic number.
1121245351 is a deficient number, since it is larger than the sum of its proper divisors (6481361).
1121245351 is an equidigital number, since it uses as much as digits as its factorization.
1121245351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6481360.
The product of its digits is 1200, while the sum is 25.
The square root of 1121245351 is about 33485.0018814394. The cubic root of 1121245351 is about 1038.8835871836.
Adding to 1121245351 its reverse (1535421211), we get a palindrome (2656666562).
The spelling of 1121245351 in words is "one billion, one hundred twenty-one million, two hundred forty-five thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •