Base | Representation |
---|---|
bin | 1011110100010001110… |
… | …1010101001001110111 |
3 | 201102000020220021001201 |
4 | 2331010131111021313 |
5 | 11311232033034143 |
6 | 233132403433331 |
7 | 20444553356116 |
oct | 2750435251167 |
9 | 642006807051 |
10 | 203012002423 |
11 | 79107a8a1aa |
12 | 33418385847 |
13 | 161b4346829 |
14 | 9b7c12dc7d |
15 | 5432ad964d |
hex | 2f44755277 |
203012002423 has 8 divisors (see below), whose sum is σ = 215429097600. Its totient is φ = 190894114488.
The previous prime is 203012002421. The next prime is 203012002451. The reversal of 203012002423 is 324200210302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 203012002423 - 21 = 203012002421 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 203012002423.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203012002421) 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, 74800413 + ... + 74803126.
It is an arithmetic number, because the mean of its divisors is an integer number (26928637200).
Almost surely, 2203012002423 is an apocalyptic number.
203012002423 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
203012002423 is a deficient number, since it is larger than the sum of its proper divisors (12417095177).
203012002423 is a wasteful number, since it uses less digits than its factorization.
203012002423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149603621.
The product of its (nonzero) digits is 576, while the sum is 19.
Adding to 203012002423 its reverse (324200210302), we get a palindrome (527212212725).
The spelling of 203012002423 in words is "two hundred three billion, twelve million, two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •