Base | Representation |
---|---|
bin | 110110001000001110010111… |
… | …001100101100111100110011 |
3 | 1011012220021200001002211112012 |
4 | 312020032113030230330303 |
5 | 222200332220341123401 |
6 | 2202151040015153135 |
7 | 101100150006135500 |
oct | 6610162714547463 |
9 | 1135807601084465 |
10 | 238059689004851 |
11 | 6994260227040a |
12 | 228496902157ab |
13 | a2aac174a1b5c |
14 | 42b0216aaa4a7 |
15 | 1c7c72b09e8bb |
hex | d8839732cf33 |
238059689004851 has 12 divisors (see below), whose sum is σ = 276935456627352. Its totient is φ = 204044619125088.
The previous prime is 238059689004791. The next prime is 238059689004869. The reversal of 238059689004851 is 158400986950832.
It is a de Polignac number, because none of the positive numbers 2k-238059689004851 is a prime.
It is a super-2 number, since 2×2380596890048512 (a number of 30 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (68) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (238059689009851) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 76347365 + ... + 79404278.
It is an arithmetic number, because the mean of its divisors is an integer number (23077954718946).
Almost surely, 2238059689004851 is an apocalyptic number.
238059689004851 is a deficient number, since it is larger than the sum of its proper divisors (38875767622501).
238059689004851 is a wasteful number, since it uses less digits than its factorization.
238059689004851 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155782850 (or 155782843 counting only the distinct ones).
The product of its (nonzero) digits is 149299200, while the sum is 68.
The spelling of 238059689004851 in words is "two hundred thirty-eight trillion, fifty-nine billion, six hundred eighty-nine million, four thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •