Base | Representation |
---|---|
bin | 1011110101010111010… |
… | …1000000001000000111 |
3 | 201102202120020211101222 |
4 | 2331111311000020013 |
5 | 11312331133423143 |
6 | 233221333510555 |
7 | 20455022363225 |
oct | 2752565001007 |
9 | 642676224358 |
10 | 203303420423 |
11 | 79247531924 |
12 | 33499aa245b |
13 | 1622c82b30c |
14 | 9ba8b0bb15 |
15 | 544d4a0768 |
hex | 2f55d40207 |
203303420423 has 8 divisors (see below), whose sum is σ = 203578467408. Its totient is φ = 203028473664.
The previous prime is 203303420357. The next prime is 203303420449. The reversal of 203303420423 is 324024303302.
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 203303420423 - 228 = 203034984967 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 203303420392 and 203303420401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203303420923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4602440 + ... + 4646402.
It is an arithmetic number, because the mean of its divisors is an integer number (25447308426).
Almost surely, 2203303420423 is an apocalyptic number.
203303420423 is a deficient number, since it is larger than the sum of its proper divisors (275046985).
203303420423 is an equidigital number, since it uses as much as digits as its factorization.
203303420423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50113.
The product of its (nonzero) digits is 10368, while the sum is 26.
Adding to 203303420423 its reverse (324024303302), we get a palindrome (527327723725).
The spelling of 203303420423 in words is "two hundred three billion, three hundred three million, four hundred twenty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •