Base | Representation |
---|---|
bin | 101111101000111001… |
… | …1101011101010011101 |
3 | 100210001202110120020221 |
4 | 1133101303223222131 |
5 | 3134004340443031 |
6 | 114555314441341 |
7 | 10251123433204 |
oct | 1372163535235 |
9 | 323052416227 |
10 | 102304234141 |
11 | 3a42908933a |
12 | 179b1593251 |
13 | 9855007bb5 |
14 | 4d470b223b |
15 | 29db695a11 |
hex | 17d1ceba9d |
102304234141 has 2 divisors, whose sum is σ = 102304234142. Its totient is φ = 102304234140.
The previous prime is 102304234133. The next prime is 102304234169. The reversal of 102304234141 is 141432403201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102114758916 + 189475225 = 319554^2 + 13765^2 .
It is an emirp because it is prime and its reverse (141432403201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102304234141 - 23 = 102304234133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102304234111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51152117070 + 51152117071.
It is an arithmetic number, because the mean of its divisors is an integer number (51152117071).
Almost surely, 2102304234141 is an apocalyptic number.
It is an amenable number.
102304234141 is a deficient number, since it is larger than the sum of its proper divisors (1).
102304234141 is an equidigital number, since it uses as much as digits as its factorization.
102304234141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 102304234141 its reverse (141432403201), we get a palindrome (243736637342).
The spelling of 102304234141 in words is "one hundred two billion, three hundred four million, two hundred thirty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •