Base | Representation |
---|---|
bin | 10111010111110… |
… | …00011100001111 |
3 | 111122220111211000 |
4 | 23223320130033 |
5 | 400142142001 |
6 | 31242031343 |
7 | 4600264236 |
oct | 1353703417 |
9 | 448814730 |
10 | 196052751 |
11 | a0737374 |
12 | 557a8553 |
13 | 3180475b |
14 | 1c075b1d |
15 | 12329a86 |
hex | baf870f |
196052751 has 24 divisors (see below), whose sum is σ = 298973360. Its totient is φ = 126882288.
The previous prime is 196052749. The next prime is 196052761. The reversal of 196052751 is 157250691.
It is not a de Polignac number, because 196052751 - 21 = 196052749 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (196052761) 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 23 ways as a sum of consecutive naturals, for example, 442336 + ... + 442778.
Almost surely, 2196052751 is an apocalyptic number.
196052751 is a deficient number, since it is larger than the sum of its proper divisors (102920609).
196052751 is an frugal number, since it uses more digits than its factorization.
196052751 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 932 (or 483 counting only the distinct ones).
The product of its (nonzero) digits is 18900, while the sum is 36.
The square root of 196052751 is about 14001.8838375413. The cubic root of 196052751 is about 580.9306808004.
The spelling of 196052751 in words is "one hundred ninety-six million, fifty-two thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •