Base | Representation |
---|---|
bin | 10111011000111… |
… | …00011010001101 |
3 | 111200011222220112 |
4 | 23230130122031 |
5 | 400211400302 |
6 | 31245125405 |
7 | 4601446613 |
oct | 1354343215 |
9 | 450158815 |
10 | 196200077 |
11 | a0828027 |
12 | 55859865 |
13 | 31856828 |
14 | 1c0b36b3 |
15 | 12358552 |
hex | bb1c68d |
196200077 has 12 divisors (see below), whose sum is σ = 209063316. Its totient is φ = 184089600.
The previous prime is 196200073. The next prime is 196200089. The reversal of 196200077 is 770002691.
It can be written as a sum of positive squares in 6 ways, for example, as 58583716 + 137616361 = 7654^2 + 11731^2 .
It is not a de Polignac number, because 196200077 - 22 = 196200073 is a prime.
It is a hoax number, since the sum of its digits (32) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (196200073) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 115043 + ... + 116735.
It is an arithmetic number, because the mean of its divisors is an integer number (17421943).
Almost surely, 2196200077 is an apocalyptic number.
196200077 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
196200077 is a deficient number, since it is larger than the sum of its proper divisors (12863239).
196200077 is a wasteful number, since it uses less digits than its factorization.
196200077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2128 (or 2111 counting only the distinct ones).
The product of its (nonzero) digits is 5292, while the sum is 32.
The square root of 196200077 is about 14007.1437845122. The cubic root of 196200077 is about 581.0761599529.
The spelling of 196200077 in words is "one hundred ninety-six million, two hundred thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •