Base | Representation |
---|---|
bin | 100001011100001… |
… | …0010100000110111 |
3 | 2220012100011012002 |
4 | 1002320102200313 |
5 | 4244221132101 |
6 | 303201245515 |
7 | 36543200033 |
oct | 10270224067 |
9 | 2805304162 |
10 | 1122052151 |
11 | 526407430 |
12 | 27393389b |
13 | 14b6021ac |
14 | a903d1c3 |
15 | 6878ed6b |
hex | 42e12837 |
1122052151 has 8 divisors (see below), whose sum is σ = 1228047744. Its totient is φ = 1016721720.
The previous prime is 1122052133. The next prime is 1122052157. The reversal of 1122052151 is 1512502211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1122052151 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122052157) 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 7 ways as a sum of consecutive naturals, for example, 162755 + ... + 169508.
It is an arithmetic number, because the mean of its divisors is an integer number (153505968).
Almost surely, 21122052151 is an apocalyptic number.
1122052151 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1122052151 is a deficient number, since it is larger than the sum of its proper divisors (105995593).
1122052151 is a wasteful number, since it uses less digits than its factorization.
1122052151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332581.
The product of its (nonzero) digits is 200, while the sum is 20.
The square root of 1122052151 is about 33497.0468996895. The cubic root of 1122052151 is about 1039.1327061121.
Adding to 1122052151 its reverse (1512502211), we get a palindrome (2634554362).
The spelling of 1122052151 in words is "one billion, one hundred twenty-two million, fifty-two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.264 sec. • engine limits •