Base | Representation |
---|---|
bin | 1000101010011111001011… |
… | …10010000010000001111001 |
3 | 2111110100122002011210110021 |
4 | 10111033211302002001321 |
5 | 4444122031433240422 |
6 | 104304214543250441 |
7 | 4004315121653455 |
oct | 425174562020171 |
9 | 74410562153407 |
10 | 19052035055737 |
11 | 6085a17115742 |
12 | 21784b3ba9a21 |
13 | a827a3587508 |
14 | 49c1a2927665 |
15 | 2308c199ddc7 |
hex | 1153e5c82079 |
19052035055737 has 2 divisors, whose sum is σ = 19052035055738. Its totient is φ = 19052035055736.
The previous prime is 19052035055731. The next prime is 19052035055741. The reversal of 19052035055737 is 73755053025091.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17956033351936 + 1096001703801 = 4237456^2 + 1046901^2 .
It is an emirp because it is prime and its reverse (73755053025091) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-19052035055737 is a prime.
It is a super-2 number, since 2×190520350557372 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (19052035055731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9526017527868 + 9526017527869.
It is an arithmetic number, because the mean of its divisors is an integer number (9526017527869).
Almost surely, 219052035055737 is an apocalyptic number.
It is an amenable number.
19052035055737 is a deficient number, since it is larger than the sum of its proper divisors (1).
19052035055737 is an equidigital number, since it uses as much as digits as its factorization.
19052035055737 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4961250, while the sum is 52.
The spelling of 19052035055737 in words is "nineteen trillion, fifty-two billion, thirty-five million, fifty-five thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •