Base | Representation |
---|---|
bin | 10111011001010… |
… | …00001001010111 |
3 | 111200021102212001 |
4 | 23230220021113 |
5 | 400214420101 |
6 | 31250140131 |
7 | 4602040021 |
oct | 1354501127 |
9 | 450242761 |
10 | 196248151 |
11 | a0860160 |
12 | 55881647 |
13 | 31872688 |
14 | 1c0c7011 |
15 | 12367901 |
hex | bb28257 |
196248151 has 8 divisors (see below), whose sum is σ = 216209808. Its totient is φ = 176640000.
The previous prime is 196248149. The next prime is 196248203. The reversal of 196248151 is 151842691.
196248151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 196248151 - 21 = 196248149 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 196248151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (196248551) 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, 87210 + ... + 89431.
It is an arithmetic number, because the mean of its divisors is an integer number (27026226).
Almost surely, 2196248151 is an apocalyptic number.
196248151 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
196248151 is a deficient number, since it is larger than the sum of its proper divisors (19961657).
196248151 is a wasteful number, since it uses less digits than its factorization.
196248151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 176753.
The product of its digits is 17280, while the sum is 37.
The square root of 196248151 is about 14008.8597323265. The cubic root of 196248151 is about 581.1236155477.
The spelling of 196248151 in words is "one hundred ninety-six million, two hundred forty-eight thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •