Base | Representation |
---|---|
bin | 10001100110110100011101… |
… | …10100100101110101101101 |
3 | 12002002022221102102012112121 |
4 | 20303122032310211311231 |
5 | 20033320342211413133 |
6 | 214202241152232541 |
7 | 11104141041351316 |
oct | 1063321664456555 |
9 | 162068842365477 |
10 | 38717231357293 |
11 | 11377981821735 |
12 | 44137aa53b751 |
13 | 187b0333a9738 |
14 | 97bcd163560d |
15 | 4721cd96e02d |
hex | 23368ed25d6d |
38717231357293 has 2 divisors, whose sum is σ = 38717231357294. Its totient is φ = 38717231357292.
The previous prime is 38717231357239. The next prime is 38717231357303. The reversal of 38717231357293 is 39275313271783.
Together with previous prime (38717231357239) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 38201336802729 + 515894554564 = 6180723^2 + 718258^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-38717231357293 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (38717231357593) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 19358615678646 + 19358615678647.
It is an arithmetic number, because the mean of its divisors is an integer number (19358615678647).
Almost surely, 238717231357293 is an apocalyptic number.
It is an amenable number.
38717231357293 is a deficient number, since it is larger than the sum of its proper divisors (1).
38717231357293 is an equidigital number, since it uses as much as digits as its factorization.
38717231357293 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 40007520, while the sum is 61.
The spelling of 38717231357293 in words is "thirty-eight trillion, seven hundred seventeen billion, two hundred thirty-one million, three hundred fifty-seven thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •