Base | Representation |
---|---|
bin | 11101001001011101010… |
… | …011000010000000111011 |
3 | 21002111010220120021022110 |
4 | 131021131103002000323 |
5 | 230304141111430021 |
6 | 4132101422423403 |
7 | 264466463223210 |
oct | 35113523020073 |
9 | 7074126507273 |
10 | 2003020030011 |
11 | 702526652060 |
12 | 284247431b63 |
13 | 116b6513c890 |
14 | 6cd379cbb07 |
15 | 371831cb476 |
hex | 1d25d4c203b |
2003020030011 has 64 divisors (see below), whose sum is σ = 3587536060416. Its totient is φ = 960031094400.
The previous prime is 2003020030001. The next prime is 2003020030013. The reversal of 2003020030011 is 1100300203002.
It is a happy number.
It is not a de Polignac number, because 2003020030011 - 211 = 2003020027963 is a prime.
It is a super-3 number, since 3×20030200300113 (a number of 38 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (2003020030013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6181350 + ... + 6497316.
It is an arithmetic number, because the mean of its divisors is an integer number (56055250944).
Almost surely, 22003020030011 is an apocalyptic number.
2003020030011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2003020030011 is a deficient number, since it is larger than the sum of its proper divisors (1584516030405).
2003020030011 is a wasteful number, since it uses less digits than its factorization.
2003020030011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318112.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 2003020030011 its reverse (1100300203002), we get a palindrome (3103320233013).
The spelling of 2003020030011 in words is "two trillion, three billion, twenty million, thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •