Base | Representation |
---|---|
bin | 101111100000010010… |
… | …0111010100001101111 |
3 | 100202022121111120121222 |
4 | 1133000210322201233 |
5 | 3132411334301231 |
6 | 114510510413555 |
7 | 10241013316643 |
oct | 1370044724157 |
9 | 322277446558 |
10 | 102015150191 |
11 | 3a29a990289 |
12 | 179308012bb |
13 | 980a15c8c6 |
14 | 4d1a940c23 |
15 | 29c10e127b |
hex | 17c093a86f |
102015150191 has 2 divisors, whose sum is σ = 102015150192. Its totient is φ = 102015150190.
The previous prime is 102015150187. The next prime is 102015150253. The reversal of 102015150191 is 191051510201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102015150191 - 22 = 102015150187 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102015150191.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102015150491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51007575095 + 51007575096.
It is an arithmetic number, because the mean of its divisors is an integer number (51007575096).
Almost surely, 2102015150191 is an apocalyptic number.
102015150191 is a deficient number, since it is larger than the sum of its proper divisors (1).
102015150191 is an equidigital number, since it uses as much as digits as its factorization.
102015150191 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 450, while the sum is 26.
Adding to 102015150191 its reverse (191051510201), we get a palindrome (293066660392).
The spelling of 102015150191 in words is "one hundred two billion, fifteen million, one hundred fifty thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •