Base | Representation |
---|---|
bin | 11101100011100010010… |
… | …011011110111100010011 |
3 | 21012011102100221021202001 |
4 | 131203202103132330103 |
5 | 231234012424301003 |
6 | 4153012135334431 |
7 | 266510413251052 |
oct | 35434223367423 |
9 | 7164370837661 |
10 | 2031021322003 |
11 | 713395651193 |
12 | 289760b21417 |
13 | 1196a83c06cb |
14 | 704327d6399 |
15 | 37c715ea61d |
hex | 1d8e24def13 |
2031021322003 has 8 divisors (see below), whose sum is σ = 2031940529936. Its totient is φ = 2030102287200.
The previous prime is 2031021321983. The next prime is 2031021322013. The reversal of 2031021322003 is 3002231201302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2031021322003 is a prime.
It is a super-2 number, since 2×20310213220032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2031021322013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27184168 + ... + 27258778.
It is an arithmetic number, because the mean of its divisors is an integer number (253992566242).
Almost surely, 22031021322003 is an apocalyptic number.
2031021322003 is a deficient number, since it is larger than the sum of its proper divisors (919207933).
2031021322003 is an equidigital number, since it uses as much as digits as its factorization.
2031021322003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86565.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 2031021322003 its reverse (3002231201302), we get a palindrome (5033252523305).
The spelling of 2031021322003 in words is "two trillion, thirty-one billion, twenty-one million, three hundred twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •