Base | Representation |
---|---|
bin | 11010001100011000100011… |
… | …001100111011000100100101 |
3 | 120002220000212020200120020202 |
4 | 122030120203030323010211 |
5 | 110044420004032403212 |
6 | 1045002124242040245 |
7 | 33156640301240216 |
oct | 3214304314730445 |
9 | 502800766616222 |
10 | 115200203403557 |
11 | 3378514a615a68 |
12 | 10b066a3049085 |
13 | 4c3844286110c |
14 | 2063a107d540d |
15 | d4b94d1860c2 |
hex | 68c62333b125 |
115200203403557 has 2 divisors, whose sum is σ = 115200203403558. Its totient is φ = 115200203403556.
The previous prime is 115200203403529. The next prime is 115200203403577. The reversal of 115200203403557 is 755304302002511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90418912960996 + 24781290442561 = 9508886^2 + 4978081^2 .
It is a cyclic number.
It is not a de Polignac number, because 115200203403557 - 28 = 115200203403301 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 115200203403557.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115200203403577) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57600101701778 + 57600101701779.
It is an arithmetic number, because the mean of its divisors is an integer number (57600101701779).
Almost surely, 2115200203403557 is an apocalyptic number.
It is an amenable number.
115200203403557 is a deficient number, since it is larger than the sum of its proper divisors (1).
115200203403557 is an equidigital number, since it uses as much as digits as its factorization.
115200203403557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 126000, while the sum is 38.
The spelling of 115200203403557 in words is "one hundred fifteen trillion, two hundred billion, two hundred three million, four hundred three thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •