Base | Representation |
---|---|
bin | 10100100010000100… |
… | …01101110111101101 |
3 | 1001110020010012010121 |
4 | 22101002031313231 |
5 | 140033420241023 |
6 | 5021453404541 |
7 | 540110520232 |
oct | 122102156755 |
9 | 31406105117 |
10 | 11023212013 |
11 | 4747352380 |
12 | 2177799751 |
13 | 1068993a78 |
14 | 767dd3789 |
15 | 447b26d5d |
hex | 29108dded |
11023212013 has 32 divisors (see below), whose sum is σ = 12537774720. Its totient is φ = 9603360000.
The previous prime is 11023211999. The next prime is 11023212019. The reversal of 11023212013 is 31021232011.
11023212013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11023212013 is a prime.
It is a super-2 number, since 2×110232120132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11023212019) 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 31 ways as a sum of consecutive naturals, for example, 9412918 + ... + 9414088.
It is an arithmetic number, because the mean of its divisors is an integer number (391805460).
Almost surely, 211023212013 is an apocalyptic number.
It is an amenable number.
11023212013 is a deficient number, since it is larger than the sum of its proper divisors (1514562707).
11023212013 is a wasteful number, since it uses less digits than its factorization.
11023212013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1549.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 11023212013 its reverse (31021232011), we get a palindrome (42044444024).
The spelling of 11023212013 in words is "eleven billion, twenty-three million, two hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •