Search a number
-
+
196015496127 = 3115939863519
BaseRepresentation
bin1011011010001101101…
…1110001101110111111
3200201221122201220201220
42312203123301232333
511202414431334002
6230014232204423
720106306140433
oct2664333615677
9621848656656
10196015496127
11761477014a0
1231ba5239713
131563a994b89
1496b6c429c3
1551737607bc
hex2da36f1bbf

196015496127 has 8 divisors (see below), whose sum is σ = 285113448960. Its totient is φ = 118797270360.

The previous prime is 196015496123. The next prime is 196015496161. The reversal of 196015496127 is 721694510691.

It is a happy number.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 196015496127 - 22 = 196015496123 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 196015496127.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (196015496123) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2969931727 + ... + 2969931792.

It is an arithmetic number, because the mean of its divisors is an integer number (35639181120).

Almost surely, 2196015496127 is an apocalyptic number.

196015496127 is a deficient number, since it is larger than the sum of its proper divisors (89097952833).

196015496127 is a wasteful number, since it uses less digits than its factorization.

196015496127 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 5939863533.

The product of its (nonzero) digits is 816480, while the sum is 51.

The spelling of 196015496127 in words is "one hundred ninety-six billion, fifteen million, four hundred ninety-six thousand, one hundred twenty-seven".

Divisors: 1 3 11 33 5939863519 17819590557 65338498709 196015496127