Base | Representation |
---|---|
bin | 100001011010100… |
… | …1000001000101001 |
3 | 2220010210001002112 |
4 | 1002311020020221 |
5 | 4244013120314 |
6 | 303131412105 |
7 | 36533145221 |
oct | 10265101051 |
9 | 2803701075 |
10 | 1121223209 |
11 | 5259a0657 |
12 | 2735b4035 |
13 | 14b3a1ab2 |
14 | a8ca5081 |
15 | 6867943e |
hex | 42d48229 |
1121223209 has 4 divisors (see below), whose sum is σ = 1122348804. Its totient is φ = 1120097616.
The previous prime is 1121223199. The next prime is 1121223223. The reversal of 1121223209 is 9023221211.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 492618025 + 628605184 = 22195^2 + 25072^2 .
It is a cyclic number.
It is not a de Polignac number, because 1121223209 - 28 = 1121222953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1121223239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 561302 + ... + 563295.
It is an arithmetic number, because the mean of its divisors is an integer number (280587201).
Almost surely, 21121223209 is an apocalyptic number.
It is an amenable number.
1121223209 is a deficient number, since it is larger than the sum of its proper divisors (1125595).
1121223209 is an equidigital number, since it uses as much as digits as its factorization.
1121223209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1125594.
The product of its (nonzero) digits is 432, while the sum is 23.
The square root of 1121223209 is about 33484.6712541724. The cubic root of 1121223209 is about 1038.8767486233.
The spelling of 1121223209 in words is "one billion, one hundred twenty-one million, two hundred twenty-three thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •