Base | Representation |
---|---|
bin | 11101001001100010001… |
… | …100001110000010011011 |
3 | 21002111100122001101210001 |
4 | 131021202030032002123 |
5 | 230304323121132311 |
6 | 4132113514233431 |
7 | 264501511114561 |
oct | 35114214160233 |
9 | 7074318041701 |
10 | 2003102130331 |
11 | 702568a28265 |
12 | 28426aa25877 |
13 | 116b79156c53 |
14 | 6cd4487da31 |
15 | 3718a4e74c1 |
hex | 1d26230e09b |
2003102130331 has 4 divisors (see below), whose sum is σ = 2031314836464. Its totient is φ = 1974889424200.
The previous prime is 2003102130329. The next prime is 2003102130353. The reversal of 2003102130331 is 1330312013002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2003102130331 - 21 = 2003102130329 is a prime.
It is a super-2 number, since 2×20031021303312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2003102130299 and 2003102130308.
It is not an unprimeable number, because it can be changed into a prime (2003102130311) 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, 14106352960 + ... + 14106353101.
It is an arithmetic number, because the mean of its divisors is an integer number (507828709116).
Almost surely, 22003102130331 is an apocalyptic number.
2003102130331 is a deficient number, since it is larger than the sum of its proper divisors (28212706133).
2003102130331 is an equidigital number, since it uses as much as digits as its factorization.
2003102130331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28212706132.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 2003102130331 its reverse (1330312013002), we get a palindrome (3333414143333).
The spelling of 2003102130331 in words is "two trillion, three billion, one hundred two million, one hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •