Base | Representation |
---|---|
bin | 11101010001001010111… |
… | …100101000011111011011 |
3 | 21010021112002202011121121 |
4 | 131101022330220133123 |
5 | 230423121314244003 |
6 | 4135551320150111 |
7 | 265211640536464 |
oct | 35211274503733 |
9 | 7107462664547 |
10 | 2011302103003 |
11 | 705a9666a086 |
12 | 285979008337 |
13 | 117884c44a9b |
14 | 6d4c191dd6b |
15 | 374ba343cbd |
hex | 1d44af287db |
2011302103003 has 8 divisors (see below), whose sum is σ = 2047867053120. Its totient is φ = 1974853049280.
The previous prime is 2011302102977. The next prime is 2011302103007. The reversal of 2011302103003 is 3003012031102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2011302103003 - 221 = 2011300005851 is a prime.
It is a super-2 number, since 2×20113021030032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2011302103007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28939075 + ... + 29008492.
It is an arithmetic number, because the mean of its divisors is an integer number (255983381640).
Almost surely, 22011302103003 is an apocalyptic number.
2011302103003 is a deficient number, since it is larger than the sum of its proper divisors (36564950117).
2011302103003 is an equidigital number, since it uses as much as digits as its factorization.
2011302103003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57948197.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 2011302103003 its reverse (3003012031102), we get a palindrome (5014314134105).
The spelling of 2011302103003 in words is "two trillion, eleven billion, three hundred two million, one hundred three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •