Base | Representation |
---|---|
bin | 10100100010001011… |
… | …11111011000000111 |
3 | 1001110021222110002000 |
4 | 22101011333120013 |
5 | 140034143414343 |
6 | 5021530520343 |
7 | 540122110230 |
oct | 122105773007 |
9 | 31407873060 |
10 | 11024201223 |
11 | 4747968602 |
12 | 2177b960b3 |
13 | 1068c4c0b9 |
14 | 7681b0087 |
15 | 447c6eed3 |
hex | 29117f607 |
11024201223 has 64 divisors (see below), whose sum is σ = 19850880000. Its totient is φ = 5906276352.
The previous prime is 11024201219. The next prime is 11024201257. The reversal of 11024201223 is 32210242011.
It is a happy number.
11024201223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11024201223 - 22 = 11024201219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11024201196 and 11024201205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11024201213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 332503 + ... + 364151.
It is an arithmetic number, because the mean of its divisors is an integer number (310170000).
Almost surely, 211024201223 is an apocalyptic number.
11024201223 is a deficient number, since it is larger than the sum of its proper divisors (8826678777).
11024201223 is a wasteful number, since it uses less digits than its factorization.
11024201223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31781 (or 31775 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 11024201223 its reverse (32210242011), we get a palindrome (43234443234).
The spelling of 11024201223 in words is "eleven billion, twenty-four million, two hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •