Base | Representation |
---|---|
bin | 100001011100100… |
… | …0100000101101101 |
3 | 2220012201110201220 |
4 | 1002321010011231 |
5 | 4244244131323 |
6 | 303205453553 |
7 | 36545004042 |
oct | 10271040555 |
9 | 2805643656 |
10 | 1122255213 |
11 | 526535a52 |
12 | 273a112b9 |
13 | 14b673751 |
14 | a90931c9 |
15 | 687d00e3 |
hex | 42e4416d |
1122255213 has 4 divisors (see below), whose sum is σ = 1496340288. Its totient is φ = 748170140.
The previous prime is 1122255203. The next prime is 1122255241. The reversal of 1122255213 is 3125522211.
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.
It is a cyclic number.
It is not a de Polignac number, because 1122255213 - 214 = 1122238829 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122255203) 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, 187042533 + ... + 187042538.
It is an arithmetic number, because the mean of its divisors is an integer number (374085072).
Almost surely, 21122255213 is an apocalyptic number.
It is an amenable number.
1122255213 is a deficient number, since it is larger than the sum of its proper divisors (374085075).
1122255213 is an equidigital number, since it uses as much as digits as its factorization.
1122255213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374085074.
The product of its digits is 1200, while the sum is 24.
The square root of 1122255213 is about 33500.0778058798. The cubic root of 1122255213 is about 1039.1953875830.
Adding to 1122255213 its reverse (3125522211), we get a palindrome (4247777424).
The spelling of 1122255213 in words is "one billion, one hundred twenty-two million, two hundred fifty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •