Base | Representation |
---|---|
bin | 10111011010001… |
… | …10000100000001 |
3 | 111200111122221111 |
4 | 23231012010001 |
5 | 400232330224 |
6 | 31252523321 |
7 | 4603060204 |
oct | 1355060401 |
9 | 450448844 |
10 | 196370689 |
11 | a0934229 |
12 | 55920541 |
13 | 318b6398 |
14 | 1c11993b |
15 | 1238dd94 |
hex | bb46101 |
196370689 has 8 divisors (see below), whose sum is σ = 212993928. Its totient is φ = 180311040.
The previous prime is 196370683. The next prime is 196370693. The reversal of 196370689 is 986073691.
It can be written as a sum of positive squares in 4 ways, for example, as 15737089 + 180633600 = 3967^2 + 13440^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 196370689 - 29 = 196370177 is a prime.
It is a super-2 number, since 2×1963706892 = 77122894996669442, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (196370683) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 140172 + ... + 141565.
It is an arithmetic number, because the mean of its divisors is an integer number (26624241).
Almost surely, 2196370689 is an apocalyptic number.
It is an amenable number.
196370689 is a deficient number, since it is larger than the sum of its proper divisors (16623239).
196370689 is a wasteful number, since it uses less digits than its factorization.
196370689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281795.
The product of its (nonzero) digits is 489888, while the sum is 49.
The square root of 196370689 is about 14013.2326391879. The cubic root of 196370689 is about 581.2445422234.
The spelling of 196370689 in words is "one hundred ninety-six million, three hundred seventy thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •