Base | Representation |
---|---|
bin | 1001000101000001110110… |
… | …00001010001001100011111 |
3 | 2121200112120100200120012201 |
4 | 10202200323001101030133 |
5 | 10104042232013231002 |
6 | 110243200102112331 |
7 | 4130231325424621 |
oct | 442407301211437 |
9 | 77615510616181 |
10 | 19963998180127 |
11 | 63a775856a9a1 |
12 | 22a51a671b6a7 |
13 | b1a79b666741 |
14 | 4d0396a8cc11 |
15 | 2494993b5087 |
hex | 12283b05131f |
19963998180127 has 2 divisors, whose sum is σ = 19963998180128. Its totient is φ = 19963998180126.
The previous prime is 19963998180043. The next prime is 19963998180173. The reversal of 19963998180127 is 72108189936991.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-19963998180127 is a prime.
It is a super-2 number, since 2×199639981801272 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 19963998180127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (19963998180187) 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, 9981999090063 + 9981999090064.
It is an arithmetic number, because the mean of its divisors is an integer number (9981999090064).
Almost surely, 219963998180127 is an apocalyptic number.
19963998180127 is a deficient number, since it is larger than the sum of its proper divisors (1).
19963998180127 is an equidigital number, since it uses as much as digits as its factorization.
19963998180127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 105815808, while the sum is 73.
The spelling of 19963998180127 in words is "nineteen trillion, nine hundred sixty-three billion, nine hundred ninety-eight million, one hundred eighty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •