Base | Representation |
---|---|
bin | 1100001011001… |
… | …00001011001111 |
3 | 21010011100022101 |
4 | 12011210023033 |
5 | 202120402231 |
6 | 14044455531 |
7 | 2350011223 |
oct | 605441317 |
9 | 233140271 |
10 | 102122191 |
11 | 52710a06 |
12 | 2a24a5a7 |
13 | 18207742 |
14 | d7c4783 |
15 | 8e73661 |
hex | 61642cf |
102122191 has 8 divisors (see below), whose sum is σ = 103665744. Its totient is φ = 100589760.
The previous prime is 102122177. The next prime is 102122201. The reversal of 102122191 is 191221201.
It is a happy number.
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 102122191 - 215 = 102089423 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 (102122171) 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 7 ways as a sum of consecutive naturals, for example, 16731 + ... + 22003.
It is an arithmetic number, because the mean of its divisors is an integer number (12958218).
Almost surely, 2102122191 is an apocalyptic number.
102122191 is a deficient number, since it is larger than the sum of its proper divisors (1543553).
102122191 is a wasteful number, since it uses less digits than its factorization.
102122191 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5561.
The product of its (nonzero) digits is 72, while the sum is 19.
The square root of 102122191 is about 10105.5524836597. The cubic root of 102122191 is about 467.4193724089.
Adding to 102122191 its reverse (191221201), we get a palindrome (293343392).
It can be divided in two parts, 10212 and 2191, that added together give a triangular number (12403 = T157).
The spelling of 102122191 in words is "one hundred two million, one hundred twenty-two thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •