Base | Representation |
---|---|
bin | 11101001001101001001… |
… | …101111100011011100101 |
3 | 21002111122211212222010200 |
4 | 131021221031330123211 |
5 | 230310043311214023 |
6 | 4132133325141113 |
7 | 264504442151166 |
oct | 35115115743345 |
9 | 7074584788120 |
10 | 2003220023013 |
11 | 70261952a830 |
12 | 2842a23ba799 |
13 | 116b976c3931 |
14 | 6cd563ab76d |
15 | 37195a33743 |
hex | 1d26937c6e5 |
2003220023013 has 12 divisors (see below), whose sum is σ = 3156589127328. Its totient is φ = 1214072741160.
The previous prime is 2003220022987. The next prime is 2003220023081. The reversal of 2003220023013 is 3103200223002.
It is a happy number.
2003220023013 is a `hidden beast` number, since 200 + 3 + 220 + 0 + 230 + 13 = 666.
It is not a de Polignac number, because 2003220023013 - 25 = 2003220022981 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2003220027013) 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 11 ways as a sum of consecutive naturals, for example, 10117272745 + ... + 10117272942.
It is an arithmetic number, because the mean of its divisors is an integer number (263049093944).
Almost surely, 22003220023013 is an apocalyptic number.
It is an amenable number.
2003220023013 is a deficient number, since it is larger than the sum of its proper divisors (1153369104315).
2003220023013 is a wasteful number, since it uses less digits than its factorization.
2003220023013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20234545704 (or 20234545701 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 2003220023013 its reverse (3103200223002), we get a palindrome (5106420246015).
The spelling of 2003220023013 in words is "two trillion, three billion, two hundred twenty million, twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •