Base | Representation |
---|---|
bin | 1010000000011101011100… |
… | …1010001000010101000011 |
3 | 1102221212201110012111001021 |
4 | 2200013113022020111003 |
5 | 2420233141334031201 |
6 | 35222415034050311 |
7 | 2213641055240431 |
oct | 240072712102503 |
9 | 42855643174037 |
10 | 11003021002051 |
11 | 356239a564521 |
12 | 1298561579997 |
13 | 61a77127cb30 |
14 | 2a0798887d51 |
15 | 1413319eaea1 |
hex | a01d7288543 |
11003021002051 has 32 divisors (see below), whose sum is σ = 12624863328000. Its totient is φ = 9504997861248.
The previous prime is 11003021001923. The next prime is 11003021002073. The reversal of 11003021002051 is 15020012030011.
It is a cyclic number.
It is not a de Polignac number, because 11003021002051 - 27 = 11003021001923 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11003021002451) 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, 199631685 + ... + 199686793.
It is an arithmetic number, because the mean of its divisors is an integer number (394526979000).
Almost surely, 211003021002051 is an apocalyptic number.
11003021002051 is a deficient number, since it is larger than the sum of its proper divisors (1621842325949).
11003021002051 is a wasteful number, since it uses less digits than its factorization.
11003021002051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64963.
The product of its (nonzero) digits is 60, while the sum is 16.
Adding to 11003021002051 its reverse (15020012030011), we get a palindrome (26023033032062).
The spelling of 11003021002051 in words is "eleven trillion, three billion, twenty-one million, two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •