Base | Representation |
---|---|
bin | 10001100110101111101001… |
… | …11110011110001100000011 |
3 | 12002002002021112121200101021 |
4 | 20303113310332132030003 |
5 | 20033300100431144011 |
6 | 214201133110250311 |
7 | 11104020060352123 |
oct | 1063276476361403 |
9 | 162062245550337 |
10 | 38714650256131 |
11 | 11376877865183 |
12 | 44131aa056997 |
13 | 187aa11722945 |
14 | 97bb28912c83 |
15 | 4720cc073471 |
hex | 2335f4f9e303 |
38714650256131 has 2 divisors, whose sum is σ = 38714650256132. Its totient is φ = 38714650256130.
The previous prime is 38714650256083. The next prime is 38714650256167. The reversal of 38714650256131 is 13165205641783.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 38714650256131 - 27 = 38714650256003 is a prime.
It is a super-2 number, since 2×387146502561312 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (38714650250131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 19357325128065 + 19357325128066.
It is an arithmetic number, because the mean of its divisors is an integer number (19357325128066).
Almost surely, 238714650256131 is an apocalyptic number.
38714650256131 is a deficient number, since it is larger than the sum of its proper divisors (1).
38714650256131 is an equidigital number, since it uses as much as digits as its factorization.
38714650256131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3628800, while the sum is 52.
The spelling of 38714650256131 in words is "thirty-eight trillion, seven hundred fourteen billion, six hundred fifty million, two hundred fifty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •