Base | Representation |
---|---|
bin | 10111000010011… |
… | …00011111000101 |
3 | 111110122011220102 |
4 | 23201030133011 |
5 | 343433020034 |
6 | 31102013445 |
7 | 4534415531 |
oct | 1341143705 |
9 | 443564812 |
10 | 193251269 |
11 | 9a0a35a2 |
12 | 54877285 |
13 | 31063583 |
14 | 1b946bc1 |
15 | 11e7497e |
hex | b84c7c5 |
193251269 has 2 divisors, whose sum is σ = 193251270. Its totient is φ = 193251268.
The previous prime is 193251251. The next prime is 193251293. The reversal of 193251269 is 962152391.
193251269 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 120780100 + 72471169 = 10990^2 + 8513^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-193251269 is a prime.
It is a super-2 number, since 2×1932512692 = 74692105940220722, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (193251469) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 96625634 + 96625635.
It is an arithmetic number, because the mean of its divisors is an integer number (96625635).
Almost surely, 2193251269 is an apocalyptic number.
It is an amenable number.
193251269 is a deficient number, since it is larger than the sum of its proper divisors (1).
193251269 is an equidigital number, since it uses as much as digits as its factorization.
193251269 is an evil number, because the sum of its binary digits is even.
The product of its digits is 29160, while the sum is 38.
The square root of 193251269 is about 13901.4844171405. The cubic root of 193251269 is about 578.1503392410.
The spelling of 193251269 in words is "one hundred ninety-three million, two hundred fifty-one thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •