Base | Representation |
---|---|
bin | 1011010110010101011… |
… | …0000000001111000101 |
3 | 200122021001121000210122 |
4 | 2311211112000033011 |
5 | 11143301242422034 |
6 | 225323021031325 |
7 | 20041426625621 |
oct | 2654526001705 |
9 | 618231530718 |
10 | 194973795269 |
11 | 757626961a0 |
12 | 319543b5545 |
13 | 15502c16c36 |
14 | 961875c181 |
15 | 511209362e |
hex | 2d655803c5 |
194973795269 has 4 divisors (see below), whose sum is σ = 212698685760. Its totient is φ = 177248904780.
The previous prime is 194973795217. The next prime is 194973795299. The reversal of 194973795269 is 962597379491.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 194973795269 - 228 = 194705359813 is a prime.
It is a super-2 number, since 2×1949737952692 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (194973795299) 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 in 3 ways as a sum of consecutive naturals, for example, 8862445229 + ... + 8862445250.
It is an arithmetic number, because the mean of its divisors is an integer number (53174671440).
Almost surely, 2194973795269 is an apocalyptic number.
It is an amenable number.
194973795269 is a deficient number, since it is larger than the sum of its proper divisors (17724890491).
194973795269 is a wasteful number, since it uses less digits than its factorization.
194973795269 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17724890490.
The product of its digits is 231472080, while the sum is 71.
The spelling of 194973795269 in words is "one hundred ninety-four billion, nine hundred seventy-three million, seven hundred ninety-five thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •