Base | Representation |
---|---|
bin | 1101111000100001011… |
… | …1100001010101001101 |
3 | 211210122020122122221112 |
4 | 3132020113201111031 |
5 | 12401432313142433 |
6 | 301323115541405 |
7 | 23142345426425 |
oct | 3361027412515 |
9 | 753566578845 |
10 | 238511068493 |
11 | 92174309a35 |
12 | 3a284a5a865 |
13 | 19650a86479 |
14 | b788a2b485 |
15 | 630e39b348 |
hex | 37885e154d |
238511068493 has 2 divisors, whose sum is σ = 238511068494. Its totient is φ = 238511068492.
The previous prime is 238511068483. The next prime is 238511068561. The reversal of 238511068493 is 394860115832.
It is a happy number.
238511068493 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 231488963689 + 7022104804 = 481133^2 + 83798^2 .
It is a cyclic number.
It is not a de Polignac number, because 238511068493 - 216 = 238511002957 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (238511068483) 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, 119255534246 + 119255534247.
It is an arithmetic number, because the mean of its divisors is an integer number (119255534247).
Almost surely, 2238511068493 is an apocalyptic number.
It is an amenable number.
238511068493 is a deficient number, since it is larger than the sum of its proper divisors (1).
238511068493 is an equidigital number, since it uses as much as digits as its factorization.
238511068493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1244160, while the sum is 50.
The spelling of 238511068493 in words is "two hundred thirty-eight billion, five hundred eleven million, sixty-eight thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •