Base | Representation |
---|---|
bin | 10010010100101110… |
… | …100001101111000101 |
3 | 1212210012011022221121 |
4 | 102110232201233011 |
5 | 310243311001312 |
6 | 13012201313541 |
7 | 1264365352651 |
oct | 222456415705 |
9 | 55705138847 |
10 | 19675093957 |
11 | 8387094332 |
12 | 39911958b1 |
13 | 1b1729963c |
14 | d490aba61 |
15 | 7a248c707 |
hex | 494ba1bc5 |
19675093957 has 2 divisors, whose sum is σ = 19675093958. Its totient is φ = 19675093956.
The previous prime is 19675093943. The next prime is 19675093969. The reversal of 19675093957 is 75939057691.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19613722401 + 61371556 = 140049^2 + 7834^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-19675093957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 19675093895 and 19675093904.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (19675091957) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9837546978 + 9837546979.
It is an arithmetic number, because the mean of its divisors is an integer number (9837546979).
Almost surely, 219675093957 is an apocalyptic number.
It is an amenable number.
19675093957 is a deficient number, since it is larger than the sum of its proper divisors (1).
19675093957 is an equidigital number, since it uses as much as digits as its factorization.
19675093957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16074450, while the sum is 61.
The spelling of 19675093957 in words is "nineteen billion, six hundred seventy-five million, ninety-three thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •