Base | Representation |
---|---|
bin | 101110010001011000010001… |
… | …100000110010000101010101 |
3 | 222200112211111220220001002212 |
4 | 232101120101200302011111 |
5 | 203133204040130203433 |
6 | 2000452351345043205 |
7 | 60602465406614342 |
oct | 5621302140620525 |
9 | 880484456801085 |
10 | 203504434225493 |
11 | 5992a822852795 |
12 | 1a9a8633326505 |
13 | 89725027c3bcb |
14 | 383794aa077c9 |
15 | 187d93d860d48 |
hex | b91611832155 |
203504434225493 has 2 divisors, whose sum is σ = 203504434225494. Its totient is φ = 203504434225492.
The previous prime is 203504434225489. The next prime is 203504434225511. The reversal of 203504434225493 is 394522434405302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 203250586533604 + 253847691889 = 14256598^2 + 503833^2 .
It is a cyclic number.
It is not a de Polignac number, because 203504434225493 - 22 = 203504434225489 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (203504434225423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101752217112746 + 101752217112747.
It is an arithmetic number, because the mean of its divisors is an integer number (101752217112747).
Almost surely, 2203504434225493 is an apocalyptic number.
It is an amenable number.
203504434225493 is a deficient number, since it is larger than the sum of its proper divisors (1).
203504434225493 is an equidigital number, since it uses as much as digits as its factorization.
203504434225493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12441600, while the sum is 50.
The spelling of 203504434225493 in words is "two hundred three trillion, five hundred four billion, four hundred thirty-four million, two hundred twenty-five thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •