Base | Representation |
---|---|
bin | 11101001001011100111… |
… | …000101101101100011001 |
3 | 21002111010102120202200202 |
4 | 131021130320231230121 |
5 | 230304132330143113 |
6 | 4132101014511545 |
7 | 264466350460445 |
oct | 35113470555431 |
9 | 7074112522622 |
10 | 2003013131033 |
11 | 70252276a822 |
12 | 2842450655b5 |
13 | 116b63895645 |
14 | 6cd36b13825 |
15 | 371827b7258 |
hex | 1d25ce2db19 |
2003013131033 has 4 divisors (see below), whose sum is σ = 2003017091088. Its totient is φ = 2003009170980.
The previous prime is 2003013130949. The next prime is 2003013131039. The reversal of 2003013131033 is 3301313103002.
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 not a de Polignac number, because 2003013131033 - 218 = 2003012868889 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2003013130996 and 2003013131014.
It is not an unprimeable number, because it can be changed into a prime (2003013131039) 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, 1087091 + ... + 2277672.
It is an arithmetic number, because the mean of its divisors is an integer number (500754272772).
Almost surely, 22003013131033 is an apocalyptic number.
It is an amenable number.
2003013131033 is a deficient number, since it is larger than the sum of its proper divisors (3960055).
2003013131033 is an equidigital number, since it uses as much as digits as its factorization.
2003013131033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3960054.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 2003013131033 its reverse (3301313103002), we get a palindrome (5304326234035).
The spelling of 2003013131033 in words is "two trillion, three billion, thirteen million, one hundred thirty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •