Base | Representation |
---|---|
bin | 1000100111111010011000… |
… | …10001000011010001100001 |
3 | 2111010220021010000220111211 |
4 | 10103331030101003101201 |
5 | 4441144332344300423 |
6 | 104155423403110121 |
7 | 3665033461452265 |
oct | 423751421032141 |
9 | 74126233026454 |
10 | 18963560150113 |
11 | 6051445364627 |
12 | 2163321b12341 |
13 | a77343702657 |
14 | 497bac3c20a5 |
15 | 22d44447710d |
hex | 113f4c443461 |
18963560150113 has 2 divisors, whose sum is σ = 18963560150114. Its totient is φ = 18963560150112.
The previous prime is 18963560150077. The next prime is 18963560150137. The reversal of 18963560150113 is 31105106536981.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10217919116304 + 8745641033809 = 3196548^2 + 2957303^2 .
It is a cyclic number.
It is not a de Polignac number, because 18963560150113 - 221 = 18963558052961 is a prime.
It is a super-2 number, since 2×189635601501132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (18963560150813) 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, 9481780075056 + 9481780075057.
It is an arithmetic number, because the mean of its divisors is an integer number (9481780075057).
Almost surely, 218963560150113 is an apocalyptic number.
It is an amenable number.
18963560150113 is a deficient number, since it is larger than the sum of its proper divisors (1).
18963560150113 is an equidigital number, since it uses as much as digits as its factorization.
18963560150113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 583200, while the sum is 49.
The spelling of 18963560150113 in words is "eighteen trillion, nine hundred sixty-three billion, five hundred sixty million, one hundred fifty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •