Base | Representation |
---|---|
bin | 1000110010100010010101… |
… | …01110101000111000011001 |
3 | 2112102210111211021112111121 |
4 | 10121101022232220320121 |
5 | 10013134441240301212 |
6 | 105035234514525241 |
7 | 4033305614033026 |
oct | 431211256507031 |
9 | 75383454245447 |
10 | 19328606572057 |
11 | 6182241572432 |
12 | 220201b296821 |
13 | aa28ab621913 |
14 | 4ab71c2c054d |
15 | 237bac40ed07 |
hex | 11944aba8e19 |
19328606572057 has 2 divisors, whose sum is σ = 19328606572058. Its totient is φ = 19328606572056.
The previous prime is 19328606572049. The next prime is 19328606572069. The reversal of 19328606572057 is 75027560682391.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14760380021776 + 4568226550281 = 3841924^2 + 2137341^2 .
It is a cyclic number.
It is not a de Polignac number, because 19328606572057 - 23 = 19328606572049 is a prime.
It is a super-2 number, since 2×193286065720572 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 19328606571986 and 19328606572004.
It is not a weakly prime, because it can be changed into another prime (19328606572097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9664303286028 + 9664303286029.
It is an arithmetic number, because the mean of its divisors is an integer number (9664303286029).
Almost surely, 219328606572057 is an apocalyptic number.
It is an amenable number.
19328606572057 is a deficient number, since it is larger than the sum of its proper divisors (1).
19328606572057 is an equidigital number, since it uses as much as digits as its factorization.
19328606572057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 38102400, while the sum is 61.
The spelling of 19328606572057 in words is "nineteen trillion, three hundred twenty-eight billion, six hundred six million, five hundred seventy-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •