Base | Representation |
---|---|
bin | 10010010100101110… |
… | …100001101111010001 |
3 | 1212210012011022222001 |
4 | 102110232201233101 |
5 | 310243311001334 |
6 | 13012201314001 |
7 | 1264365352666 |
oct | 222456415721 |
9 | 55705138861 |
10 | 19675093969 |
11 | 8387094343 |
12 | 3991195901 |
13 | 1b1729964b |
14 | d490aba6d |
15 | 7a248c714 |
hex | 494ba1bd1 |
19675093969 has 2 divisors, whose sum is σ = 19675093970. Its totient is φ = 19675093968.
The previous prime is 19675093957. The next prime is 19675093979. The reversal of 19675093969 is 96939057691.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15841998225 + 3833095744 = 125865^2 + 61912^2 .
It is a cyclic number.
It is not a de Polignac number, because 19675093969 - 211 = 19675091921 is a prime.
It is a super-2 number, since 2×196750939692 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 19675093969.
It is not a weakly prime, because it can be changed into another prime (19675093979) 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, 9837546984 + 9837546985.
It is an arithmetic number, because the mean of its divisors is an integer number (9837546985).
Almost surely, 219675093969 is an apocalyptic number.
It is an amenable number.
19675093969 is a deficient number, since it is larger than the sum of its proper divisors (1).
19675093969 is an equidigital number, since it uses as much as digits as its factorization.
19675093969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24800580, while the sum is 64.
The spelling of 19675093969 in words is "nineteen billion, six hundred seventy-five million, ninety-three thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •