Base | Representation |
---|---|
bin | 10100100011001001… |
… | …00000111100000101 |
3 | 1001110212000222110121 |
4 | 22101210200330011 |
5 | 140043220444023 |
6 | 5022414221541 |
7 | 540250115116 |
oct | 122144407405 |
9 | 31425028417 |
10 | 11032203013 |
11 | 4751433457 |
12 | 217a7b48b1 |
13 | 106a7c12a0 |
14 | 76929420d |
15 | 448800d5d |
hex | 291920f05 |
11032203013 has 32 divisors (see below), whose sum is σ = 12379767680. Its totient is φ = 9765100800.
The previous prime is 11032202917. The next prime is 11032203059. The reversal of 11032203013 is 31030223011.
It is not a de Polignac number, because 11032203013 - 225 = 10998648581 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11032203313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10496338 + ... + 10497388.
It is an arithmetic number, because the mean of its divisors is an integer number (386867740).
Almost surely, 211032203013 is an apocalyptic number.
11032203013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11032203013 is a deficient number, since it is larger than the sum of its proper divisors (1347564667).
11032203013 is a wasteful number, since it uses less digits than its factorization.
11032203013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1397.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 11032203013 its reverse (31030223011), we get a palindrome (42062426024).
The spelling of 11032203013 in words is "eleven billion, thirty-two million, two hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •