Base | Representation |
---|---|
bin | 1011011100101000000… |
… | …0000000000111011101 |
3 | 200210121202020110110011 |
4 | 2313022000000013131 |
5 | 11210231101321204 |
6 | 230202344243221 |
7 | 20131323615235 |
oct | 2671200000735 |
9 | 623552213404 |
10 | 196662526429 |
11 | 76449961986 |
12 | 32145a70511 |
13 | 15711a49245 |
14 | 9738b4ccc5 |
15 | 51b046d304 |
hex | 2dca0001dd |
196662526429 has 4 divisors (see below), whose sum is σ = 201977729884. Its totient is φ = 191347322976.
The previous prime is 196662526343. The next prime is 196662526447. The reversal of 196662526429 is 924625266691.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 113010268900 + 83652257529 = 336170^2 + 289227^2 .
It is a cyclic number.
It is not a de Polignac number, because 196662526429 - 223 = 196654137821 is a prime.
It is a super-2 number, since 2×1966625264292 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (196662526129) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2657601672 + ... + 2657601745.
It is an arithmetic number, because the mean of its divisors is an integer number (50494432471).
Almost surely, 2196662526429 is an apocalyptic number.
It is an amenable number.
196662526429 is a deficient number, since it is larger than the sum of its proper divisors (5315203455).
196662526429 is an equidigital number, since it uses as much as digits as its factorization.
196662526429 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5315203454.
The product of its digits is 16796160, while the sum is 58.
The spelling of 196662526429 in words is "one hundred ninety-six billion, six hundred sixty-two million, five hundred twenty-six thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •