Base | Representation |
---|---|
bin | 11101001001100011010… |
… | …000110001111011010011 |
3 | 21002111101212212111211000 |
4 | 131021203100301323103 |
5 | 230304342221244443 |
6 | 4132115355353043 |
7 | 264502116641436 |
oct | 35114320617323 |
9 | 7074355774730 |
10 | 2003120103123 |
11 | 702578093507 |
12 | 284274a52783 |
13 | 116b7caaa739 |
14 | 6cd46ddb81d |
15 | 3718bd978d3 |
hex | 1d263431ed3 |
2003120103123 has 16 divisors (see below), whose sum is σ = 2968646438560. Its totient is φ = 1334935906848.
The previous prime is 2003120103113. The next prime is 2003120103197. The reversal of 2003120103123 is 3213010213002.
It is not a de Polignac number, because 2003120103123 - 25 = 2003120103091 is a prime.
It is a super-3 number, since 3×20031201031233 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2003120103096 and 2003120103105.
It is not an unprimeable number, because it can be changed into a prime (2003120103113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13186840 + ... + 13337877.
It is an arithmetic number, because the mean of its divisors is an integer number (185540402410).
Almost surely, 22003120103123 is an apocalyptic number.
2003120103123 is a deficient number, since it is larger than the sum of its proper divisors (965526335437).
2003120103123 is a wasteful number, since it uses less digits than its factorization.
2003120103123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26527523 (or 26527517 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 2003120103123 its reverse (3213010213002), we get a palindrome (5216130316125).
The spelling of 2003120103123 in words is "two trillion, three billion, one hundred twenty million, one hundred three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •