Base | Representation |
---|---|
bin | 11101001001101110101… |
… | …100111000101101010111 |
3 | 21002111220020222220201000 |
4 | 131021232230320231113 |
5 | 230310240334122221 |
6 | 4132150413034343 |
7 | 264506640132660 |
oct | 35115654705527 |
9 | 7074806886630 |
10 | 2003312020311 |
11 | 702666455758 |
12 | 2843091859b3 |
13 | 116bb07949c4 |
14 | 6cd646b8367 |
15 | 3719db56e26 |
hex | 1d26eb38b57 |
2003312020311 has 16 divisors (see below), whose sum is σ = 3391851040000. Its totient is φ = 1144749725784.
The previous prime is 2003312020309. The next prime is 2003312020351. The reversal of 2003312020311 is 1130202133002.
2003312020311 is a `hidden beast` number, since 2 + 0 + 0 + 331 + 2 + 0 + 20 + 311 = 666.
It is not a de Polignac number, because 2003312020311 - 21 = 2003312020309 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 (2003312020351) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5299767061 + ... + 5299767438.
It is an arithmetic number, because the mean of its divisors is an integer number (211990690000).
Almost surely, 22003312020311 is an apocalyptic number.
2003312020311 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2003312020311 is a deficient number, since it is larger than the sum of its proper divisors (1388539019689).
2003312020311 is a wasteful number, since it uses less digits than its factorization.
2003312020311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10599534515 (or 10599534509 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 2003312020311 its reverse (1130202133002), we get a palindrome (3133514153313).
The spelling of 2003312020311 in words is "two trillion, three billion, three hundred twelve million, twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •