Base | Representation |
---|---|
bin | 11010001001101010001110… |
… | …001101101011101000100001 |
3 | 120002020010201010110210001111 |
4 | 122021222032031223220201 |
5 | 110033333131133003203 |
6 | 1044340130240303321 |
7 | 33140262600264103 |
oct | 3211521615535041 |
9 | 502203633423044 |
10 | 115013020203553 |
11 | 3371282558135a |
12 | 10a96363911b41 |
13 | 4c238b198c384 |
14 | 20589349d1573 |
15 | d46b4502726d |
hex | 689a8e36ba21 |
115013020203553 has 2 divisors, whose sum is σ = 115013020203554. Its totient is φ = 115013020203552.
The previous prime is 115013020203533. The next prime is 115013020203563. The reversal of 115013020203553 is 355302020310511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86823111323664 + 28189908879889 = 9317892^2 + 5309417^2 .
It is an emirp because it is prime and its reverse (355302020310511) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 115013020203553 - 229 = 115012483332641 is a prime.
It is a super-3 number, since 3×1150130202035533 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (115013020203533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57506510101776 + 57506510101777.
It is an arithmetic number, because the mean of its divisors is an integer number (57506510101777).
Almost surely, 2115013020203553 is an apocalyptic number.
It is an amenable number.
115013020203553 is a deficient number, since it is larger than the sum of its proper divisors (1).
115013020203553 is an equidigital number, since it uses as much as digits as its factorization.
115013020203553 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13500, while the sum is 31.
The spelling of 115013020203553 in words is "one hundred fifteen trillion, thirteen billion, twenty million, two hundred three thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •