Base | Representation |
---|---|
bin | 10100111001111010… |
… | …00111010101101101 |
3 | 1001222011102200122001 |
4 | 22130331013111231 |
5 | 140441114414013 |
6 | 5053400052301 |
7 | 545056431004 |
oct | 123475072555 |
9 | 31864380561 |
10 | 11223201133 |
11 | 483a228141 |
12 | 2212764091 |
13 | 109b246121 |
14 | 7867b1c3b |
15 | 45a47cddd |
hex | 29cf4756d |
11223201133 has 8 divisors (see below), whose sum is σ = 11498530680. Its totient is φ = 10947947520.
The previous prime is 11223201097. The next prime is 11223201137. The reversal of 11223201133 is 33110232211.
It can be written as a sum of positive squares in 4 ways, for example, as 1888163209 + 9335037924 = 43453^2 + 96618^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11223201133 - 29 = 11223200621 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11223201133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11223201137) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 383463 + ... + 411691.
It is an arithmetic number, because the mean of its divisors is an integer number (1437316335).
Almost surely, 211223201133 is an apocalyptic number.
It is an amenable number.
11223201133 is a deficient number, since it is larger than the sum of its proper divisors (275329547).
11223201133 is an equidigital number, since it uses as much as digits as its factorization.
11223201133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37967.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 11223201133 its reverse (33110232211), we get a palindrome (44333433344).
The spelling of 11223201133 in words is "eleven billion, two hundred twenty-three million, two hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •