Base | Representation |
---|---|
bin | 11101001001011100001… |
… | …010011111001110000001 |
3 | 21002111002120210010001012 |
4 | 131021130022133032001 |
5 | 230304121224404441 |
6 | 4132055503050305 |
7 | 264466142460323 |
oct | 35113412371601 |
9 | 7074076703035 |
10 | 2003001013121 |
11 | 702516943419 |
12 | 284240ba0995 |
13 | 116b61211a94 |
14 | 6cd3527b613 |
15 | 371816c19eb |
hex | 1d25c29f381 |
2003001013121 has 4 divisors (see below), whose sum is σ = 2003664481200. Its totient is φ = 2002337545044.
The previous prime is 2003001013093. The next prime is 2003001013147. The reversal of 2003001013121 is 1213101003002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2003001013121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2003001013096 and 2003001013105.
It is not an unprimeable number, because it can be changed into a prime (2003001019121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 331729511 + ... + 331735548.
It is an arithmetic number, because the mean of its divisors is an integer number (500916120300).
Almost surely, 22003001013121 is an apocalyptic number.
It is an amenable number.
2003001013121 is a deficient number, since it is larger than the sum of its proper divisors (663468079).
2003001013121 is an equidigital number, since it uses as much as digits as its factorization.
2003001013121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 663468078.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 2003001013121 its reverse (1213101003002), we get a palindrome (3216102016123).
The spelling of 2003001013121 in words is "two trillion, three billion, one million, thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •