Base | Representation |
---|---|
bin | 1001000011000010000001… |
… | …10010000000000110000001 |
3 | 2121102222102220202100010001 |
4 | 10201201000302000012001 |
5 | 10101431212043130411 |
6 | 110151450445040001 |
7 | 4122251643213661 |
oct | 441410062000601 |
9 | 77388386670101 |
10 | 19895375364481 |
11 | 63806437a3911 |
12 | 2293a34b56001 |
13 | b1418363c996 |
14 | 4cad26d2a1a1 |
15 | 2477ceb3ddc1 |
hex | 121840c80181 |
19895375364481 has 2 divisors, whose sum is σ = 19895375364482. Its totient is φ = 19895375364480.
The previous prime is 19895375364437. The next prime is 19895375364497. The reversal of 19895375364481 is 18446357359891.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18726035914881 + 1169339449600 = 4327359^2 + 1081360^2 .
It is a cyclic number.
It is not a de Polignac number, because 19895375364481 - 211 = 19895375362433 is a prime.
It is a super-2 number, since 2×198953753644812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (19895375364581) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9947687682240 + 9947687682241.
It is an arithmetic number, because the mean of its divisors is an integer number (9947687682241).
Almost surely, 219895375364481 is an apocalyptic number.
It is an amenable number.
19895375364481 is a deficient number, since it is larger than the sum of its proper divisors (1).
19895375364481 is an equidigital number, since it uses as much as digits as its factorization.
19895375364481 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 783820800, while the sum is 73.
The spelling of 19895375364481 in words is "nineteen trillion, eight hundred ninety-five billion, three hundred seventy-five million, three hundred sixty-four thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •