Base | Representation |
---|---|
bin | 10100100001101101… |
… | …10011101001010101 |
3 | 1001110000111020020211 |
4 | 22100312303221111 |
5 | 140032134033023 |
6 | 5021305325421 |
7 | 540043222144 |
oct | 122066635125 |
9 | 31400436224 |
10 | 11020221013 |
11 | 474569a17a |
12 | 2176796871 |
13 | 1068187549 |
14 | 76785575b |
15 | 447735a0d |
hex | 290db3a55 |
11020221013 has 16 divisors (see below), whose sum is σ = 11286475200. Its totient is φ = 10756912000.
The previous prime is 11020220993. The next prime is 11020221041. The reversal of 11020221013 is 31012202011.
11020221013 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-11020221013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11020220984 and 11020221002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020221053) 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 15 ways as a sum of consecutive naturals, for example, 5759745 + ... + 5761657.
It is an arithmetic number, because the mean of its divisors is an integer number (705404700).
Almost surely, 211020221013 is an apocalyptic number.
It is an amenable number.
11020221013 is a deficient number, since it is larger than the sum of its proper divisors (266254187).
11020221013 is a wasteful number, since it uses less digits than its factorization.
11020221013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2612.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 11020221013 its reverse (31012202011), we get a palindrome (42032423024).
The spelling of 11020221013 in words is "eleven billion, twenty million, two hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •