Base | Representation |
---|---|
bin | 110101010000110100010010… |
… | …101010110110001110100101 |
3 | 1010201102021200022202211022121 |
4 | 311100310102222312032211 |
5 | 221200441322333410224 |
6 | 2150113535042025541 |
7 | 100225105010020666 |
oct | 6520642252661645 |
9 | 1121367608684277 |
10 | 234252124513189 |
11 | 6870484a390442 |
12 | 2233376a6482b1 |
13 | a092b5a777023 |
14 | 41bbc12d4d36d |
15 | 1c1367e3e7be4 |
hex | d50d12ab63a5 |
234252124513189 has 2 divisors, whose sum is σ = 234252124513190. Its totient is φ = 234252124513188.
The previous prime is 234252124513051. The next prime is 234252124513201. The reversal of 234252124513189 is 981315421252432.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 164195776932100 + 70056347581089 = 12813890^2 + 8369967^2 .
It is a cyclic number.
It is not a de Polignac number, because 234252124513189 - 229 = 234251587642277 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (234252124513489) 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, 117126062256594 + 117126062256595.
It is an arithmetic number, because the mean of its divisors is an integer number (117126062256595).
Almost surely, 2234252124513189 is an apocalyptic number.
It is an amenable number.
234252124513189 is a deficient number, since it is larger than the sum of its proper divisors (1).
234252124513189 is an equidigital number, since it uses as much as digits as its factorization.
234252124513189 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4147200, while the sum is 52.
The spelling of 234252124513189 in words is "two hundred thirty-four trillion, two hundred fifty-two billion, one hundred twenty-four million, five hundred thirteen thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •