Base | Representation |
---|---|
bin | 1000110100000110010000… |
… | …11011101111000110001101 |
3 | 2112121220222200112212000022 |
4 | 10122003020123233012031 |
5 | 10020024324304403144 |
6 | 105120030214111525 |
7 | 4040215231326431 |
oct | 432031033570615 |
9 | 75556880485008 |
10 | 19382255153549 |
11 | 61a2a71815792 |
12 | 22104b204b5a5 |
13 | aa797b2512b2 |
14 | 4b016b4089c1 |
15 | 23929c260cee |
hex | 11a0c86ef18d |
19382255153549 has 2 divisors, whose sum is σ = 19382255153550. Its totient is φ = 19382255153548.
The previous prime is 19382255153533. The next prime is 19382255153551. The reversal of 19382255153549 is 94535155228391.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14217348948100 + 5164906205449 = 3770590^2 + 2272643^2 .
It is a cyclic number.
It is not a de Polignac number, because 19382255153549 - 24 = 19382255153533 is a prime.
Together with 19382255153551, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 19382255153491 and 19382255153500.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (19382255153509) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9691127576774 + 9691127576775.
It is an arithmetic number, because the mean of its divisors is an integer number (9691127576775).
Almost surely, 219382255153549 is an apocalyptic number.
It is an amenable number.
19382255153549 is a deficient number, since it is larger than the sum of its proper divisors (1).
19382255153549 is an equidigital number, since it uses as much as digits as its factorization.
19382255153549 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 58320000, while the sum is 62.
The spelling of 19382255153549 in words is "nineteen trillion, three hundred eighty-two billion, two hundred fifty-five million, one hundred fifty-three thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •