Base | Representation |
---|---|
bin | 1011110101100011101… |
… | …1110100110010000101 |
3 | 201102220012022210212101 |
4 | 2331120323310302011 |
5 | 11312433004244423 |
6 | 233230434552101 |
7 | 20456224401151 |
oct | 2753073646205 |
9 | 642805283771 |
10 | 203355540613 |
11 | 792739a0565 |
12 | 334b3438631 |
13 | 1623a579774 |
14 | 9bb19d8061 |
15 | 5452d487ad |
hex | 2f58ef4c85 |
203355540613 has 2 divisors, whose sum is σ = 203355540614. Its totient is φ = 203355540612.
The previous prime is 203355540599. The next prime is 203355540623. The reversal of 203355540613 is 316045553302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 140162630689 + 63192909924 = 374383^2 + 251382^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-203355540613 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (203355540623) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101677770306 + 101677770307.
It is an arithmetic number, because the mean of its divisors is an integer number (101677770307).
Almost surely, 2203355540613 is an apocalyptic number.
It is an amenable number.
203355540613 is a deficient number, since it is larger than the sum of its proper divisors (1).
203355540613 is an equidigital number, since it uses as much as digits as its factorization.
203355540613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162000, while the sum is 37.
The spelling of 203355540613 in words is "two hundred three billion, three hundred fifty-five million, five hundred forty thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •