Base | Representation |
---|---|
bin | 11101001001101001011… |
… | …010011101010000111111 |
3 | 21002111200002001121202020 |
4 | 131021221122131100333 |
5 | 230310100131200411 |
6 | 4132133523331223 |
7 | 264504512062413 |
oct | 35115132352077 |
9 | 7074602047666 |
10 | 2003223303231 |
11 | 702620370257 |
12 | 2842a3520b13 |
13 | 116b982a19a7 |
14 | 6cd569c2d43 |
15 | 37195e80606 |
hex | 1d26969d43f |
2003223303231 has 8 divisors (see below), whose sum is σ = 2671545446064. Its totient is φ = 1335191681280.
The previous prime is 2003223303199. The next prime is 2003223303233. The reversal of 2003223303231 is 1323033223002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2003223303231 - 25 = 2003223303199 is a prime.
It is a super-2 number, since 2×20032233032312 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2003223303233) 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, 72614130 + ... + 72641711.
It is an arithmetic number, because the mean of its divisors is an integer number (333943180758).
Almost surely, 22003223303231 is an apocalyptic number.
2003223303231 is a deficient number, since it is larger than the sum of its proper divisors (668322142833).
2003223303231 is a wasteful number, since it uses less digits than its factorization.
2003223303231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145260441.
The product of its (nonzero) digits is 3888, while the sum is 24.
Adding to 2003223303231 its reverse (1323033223002), we get a palindrome (3326256526233).
The spelling of 2003223303231 in words is "two trillion, three billion, two hundred twenty-three million, three hundred three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •