Base | Representation |
---|---|
bin | 11101001001011100111… |
… | …000010101110000110101 |
3 | 21002111010102101210020101 |
4 | 131021130320111300311 |
5 | 230304132314024023 |
6 | 4132101012434101 |
7 | 264466346601616 |
oct | 35113470256065 |
9 | 7074112353211 |
10 | 2003013033013 |
11 | 702522703113 |
12 | 284245018931 |
13 | 116b6385cb45 |
14 | 6cd36ac9c0d |
15 | 371827981ad |
hex | 1d25ce15c35 |
2003013033013 has 4 divisors (see below), whose sum is σ = 2003085041760. Its totient is φ = 2002941024268.
The previous prime is 2003013032981. The next prime is 2003013033079. The reversal of 2003013033013 is 3103303103002.
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 2003013033013 - 25 = 2003013032981 is a prime.
It is a super-2 number, since 2×20030130330132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2003013033083) 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, 35962633 + ... + 36018286.
It is an arithmetic number, because the mean of its divisors is an integer number (500771260440).
Almost surely, 22003013033013 is an apocalyptic number.
It is an amenable number.
2003013033013 is a deficient number, since it is larger than the sum of its proper divisors (72008747).
2003013033013 is an equidigital number, since it uses as much as digits as its factorization.
2003013033013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72008746.
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 2003013033013 its reverse (3103303103002), we get a palindrome (5106316136015).
The spelling of 2003013033013 in words is "two trillion, three billion, thirteen million, thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •