Base | Representation |
---|---|
bin | 10111010100101… |
… | …00100011100011 |
3 | 111122010201120222 |
4 | 23222110203203 |
5 | 400041043434 |
6 | 31225153255 |
7 | 4563641363 |
oct | 1352244343 |
9 | 448121528 |
10 | 195643619 |
11 | a0487a46 |
12 | 5562b82b |
13 | 316c0472 |
14 | 1bdaa9a3 |
15 | 1229872e |
hex | ba948e3 |
195643619 has 2 divisors, whose sum is σ = 195643620. Its totient is φ = 195643618.
The previous prime is 195643561. The next prime is 195643621. The reversal of 195643619 is 916346591.
195643619 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (916346591) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 195643619 - 216 = 195578083 is a prime.
It is a super-2 number, since 2×1956436192 = 76552851310834322, which contains 22 as substring.
Together with 195643621, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 195643619.
It is not a weakly prime, because it can be changed into another prime (195643919) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 97821809 + 97821810.
It is an arithmetic number, because the mean of its divisors is an integer number (97821810).
Almost surely, 2195643619 is an apocalyptic number.
195643619 is a deficient number, since it is larger than the sum of its proper divisors (1).
195643619 is an equidigital number, since it uses as much as digits as its factorization.
195643619 is an evil number, because the sum of its binary digits is even.
The product of its digits is 174960, while the sum is 44.
The square root of 195643619 is about 13987.2663161892. The cubic root of 195643619 is about 580.5262949840.
The spelling of 195643619 in words is "one hundred ninety-five million, six hundred forty-three thousand, six hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •