Base | Representation |
---|---|
bin | 10111011000000… |
… | …10101100000111 |
3 | 111122222122101200 |
4 | 23230002230013 |
5 | 400200012402 |
6 | 31242553543 |
7 | 4600530513 |
oct | 1354025407 |
9 | 448878350 |
10 | 196094727 |
11 | a0765964 |
12 | 558088b3 |
13 | 3181a8aa |
14 | 1c087143 |
15 | 1233721c |
hex | bb02b07 |
196094727 has 24 divisors (see below), whose sum is σ = 287937936. Its totient is φ = 128583936.
The previous prime is 196094713. The next prime is 196094741. The reversal of 196094727 is 727490691.
196094727 is a `hidden beast` number, since 19 + 609 + 4 + 7 + 27 = 666.
It is an interprime number because it is at equal distance from previous prime (196094713) and next prime (196094741).
It is not a de Polignac number, because 196094727 - 27 = 196094599 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (196094707) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 150543 + ... + 151839.
It is an arithmetic number, because the mean of its divisors is an integer number (11997414).
Almost surely, 2196094727 is an apocalyptic number.
196094727 is a deficient number, since it is larger than the sum of its proper divisors (91843209).
196094727 is a wasteful number, since it uses less digits than its factorization.
196094727 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1567 (or 1564 counting only the distinct ones).
The product of its (nonzero) digits is 190512, while the sum is 45.
The square root of 196094727 is about 14003.3826984768. The cubic root of 196094727 is about 580.9721380204.
It can be divided in two parts, 19609 and 4727, that added together give a square (24336 = 1562).
The spelling of 196094727 in words is "one hundred ninety-six million, ninety-four thousand, seven hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •