Base | Representation |
---|---|
bin | 1011110101100010101… |
… | …1011101110111000101 |
3 | 201102212220020221120110 |
4 | 2331120223131313011 |
5 | 11312430410034141 |
6 | 233230203023233 |
7 | 20456143061142 |
oct | 2753053356705 |
9 | 642786227513 |
10 | 203351252421 |
11 | 792715317a9 |
12 | 334b1b0ab19 |
13 | 16239707985 |
14 | 9bb11dd3c9 |
15 | 545279ce16 |
hex | 2f58adddc5 |
203351252421 has 4 divisors (see below), whose sum is σ = 271135003232. Its totient is φ = 135567501612.
The previous prime is 203351252417. The next prime is 203351252431. The reversal of 203351252421 is 124252153302.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 203351252421 - 22 = 203351252417 is a prime.
It is a super-2 number, since 2×2033512524212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203351252431) 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 3 ways as a sum of consecutive naturals, for example, 33891875401 + ... + 33891875406.
It is an arithmetic number, because the mean of its divisors is an integer number (67783750808).
Almost surely, 2203351252421 is an apocalyptic number.
It is an amenable number.
203351252421 is a deficient number, since it is larger than the sum of its proper divisors (67783750811).
203351252421 is an equidigital number, since it uses as much as digits as its factorization.
203351252421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67783750810.
The product of its (nonzero) digits is 14400, while the sum is 30.
The spelling of 203351252421 in words is "two hundred three billion, three hundred fifty-one million, two hundred fifty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •