Base | Representation |
---|---|
bin | 10111000111100… |
… | …11110000011001 |
3 | 111111220222201222 |
4 | 23203303300121 |
5 | 344121431114 |
6 | 31124421425 |
7 | 4543301162 |
oct | 1343636031 |
9 | 444828658 |
10 | 193936409 |
11 | 9a521327 |
12 | 54b47875 |
13 | 31243394 |
14 | 1ba84769 |
15 | 1205c98e |
hex | b8f3c19 |
193936409 has 2 divisors, whose sum is σ = 193936410. Its totient is φ = 193936408.
The previous prime is 193936373. The next prime is 193936411. The reversal of 193936409 is 904639391.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102313225 + 91623184 = 10115^2 + 9572^2 .
It is a cyclic number.
It is not a de Polignac number, because 193936409 - 212 = 193932313 is a prime.
It is a super-2 number, since 2×1939364092 = 75222661471630562, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 193936411, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 193936409.
It is not a weakly prime, because it can be changed into another prime (193936489) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 96968204 + 96968205.
It is an arithmetic number, because the mean of its divisors is an integer number (96968205).
Almost surely, 2193936409 is an apocalyptic number.
It is an amenable number.
193936409 is a deficient number, since it is larger than the sum of its proper divisors (1).
193936409 is an equidigital number, since it uses as much as digits as its factorization.
193936409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 157464, while the sum is 44.
The square root of 193936409 is about 13926.1053062226. The cubic root of 193936409 is about 578.8327784418.
The spelling of 193936409 in words is "one hundred ninety-three million, nine hundred thirty-six thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •