Base | Representation |
---|---|
bin | 1011010011101101011… |
… | …0011000101011111101 |
3 | 200120102221212112121102 |
4 | 2310323112120223331 |
5 | 11140330412033344 |
6 | 225125052142445 |
7 | 20015113253624 |
oct | 2647326305375 |
9 | 616387775542 |
10 | 194269252349 |
11 | 75430a23717 |
12 | 31798467a25 |
13 | 1541cc76b33 |
14 | 958cd606bb |
15 | 50c02c4e4e |
hex | 2d3b598afd |
194269252349 has 2 divisors, whose sum is σ = 194269252350. Its totient is φ = 194269252348.
The previous prime is 194269252279. The next prime is 194269252351. The reversal of 194269252349 is 943252962491.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 189644572324 + 4624680025 = 435482^2 + 68005^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-194269252349 is a prime.
Together with 194269252351, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 194269252294 and 194269252303.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (194269252549) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 97134626174 + 97134626175.
It is an arithmetic number, because the mean of its divisors is an integer number (97134626175).
Almost surely, 2194269252349 is an apocalyptic number.
It is an amenable number.
194269252349 is a deficient number, since it is larger than the sum of its proper divisors (1).
194269252349 is an equidigital number, since it uses as much as digits as its factorization.
194269252349 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8398080, while the sum is 56.
The spelling of 194269252349 in words is "one hundred ninety-four billion, two hundred sixty-nine million, two hundred fifty-two thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •