Base | Representation |
---|---|
bin | 11101001001101110101… |
… | …100111000111010000011 |
3 | 21002111220020222221211002 |
4 | 131021232230320322003 |
5 | 230310240334133443 |
6 | 4132150413042215 |
7 | 264506640135230 |
oct | 35115654707203 |
9 | 7074806887732 |
10 | 2003312021123 |
11 | 702666456326 |
12 | 28430918636b |
13 | 116bb079519a |
14 | 6cd646b8787 |
15 | 3719db572b8 |
hex | 1d26eb38e83 |
2003312021123 has 8 divisors (see below), whose sum is σ = 2294444379648. Its totient is φ = 1713415894344.
The previous prime is 2003312021093. The next prime is 2003312021129. The reversal of 2003312021123 is 3211202133002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2003312021123 - 218 = 2003311758979 is a prime.
It is a super-2 number, since 2×20033120211232 (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 = 2003312021095 and 2003312021104.
It is not an unprimeable number, because it can be changed into a prime (2003312021129) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 309054461 + ... + 309060942.
It is an arithmetic number, because the mean of its divisors is an integer number (286805547456).
Almost surely, 22003312021123 is an apocalyptic number.
2003312021123 is a deficient number, since it is larger than the sum of its proper divisors (291132358525).
2003312021123 is an equidigital number, since it uses as much as digits as its factorization.
2003312021123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 618115873.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2003312021123 its reverse (3211202133002), we get a palindrome (5214514154125).
The spelling of 2003312021123 in words is "two trillion, three billion, three hundred twelve million, twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •