Base | Representation |
---|---|
bin | 111100001110100111111… |
… | …100001011011000000111 |
3 | 112122200011001010022120122 |
4 | 330032213330023120013 |
5 | 1020302401443420414 |
6 | 12445212055052155 |
7 | 605011040452625 |
oct | 74164774133007 |
9 | 15580131108518 |
10 | 4138871076359 |
11 | 1356315905768 |
12 | 56a18367105b |
13 | 2403a8820976 |
14 | 104472a60515 |
15 | 729dca30b8e |
hex | 3c3a7f0b607 |
4138871076359 has 2 divisors, whose sum is σ = 4138871076360. Its totient is φ = 4138871076358.
The previous prime is 4138871076337. The next prime is 4138871076367. The reversal of 4138871076359 is 9536701788314.
It is a happy number.
4138871076359 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4138871076359 is a prime.
It is a super-2 number, since 2×41388710763592 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4138871072359) 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, 2069435538179 + 2069435538180.
It is an arithmetic number, because the mean of its divisors is an integer number (2069435538180).
Almost surely, 24138871076359 is an apocalyptic number.
4138871076359 is a deficient number, since it is larger than the sum of its proper divisors (1).
4138871076359 is an equidigital number, since it uses as much as digits as its factorization.
4138871076359 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30481920, while the sum is 62.
The spelling of 4138871076359 in words is "four trillion, one hundred thirty-eight billion, eight hundred seventy-one million, seventy-six thousand, three hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •