Base | Representation |
---|---|
bin | 111000001011000111001… |
… | …101110011000110101111 |
3 | 111200000220120110002001202 |
4 | 320023013031303012233 |
5 | 1001221214031234431 |
6 | 12113210102000115 |
7 | 545614631250542 |
oct | 70130715630657 |
9 | 14600816402052 |
10 | 3860222914991 |
11 | 12591252218a3 |
12 | 524178a1603b |
13 | 22002c484c01 |
14 | d4b9b57a859 |
15 | 6a62eb1c8cb |
hex | 382c73731af |
3860222914991 has 2 divisors, whose sum is σ = 3860222914992. Its totient is φ = 3860222914990.
The previous prime is 3860222914987. The next prime is 3860222914993. The reversal of 3860222914991 is 1994192220683.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3860222914991 - 22 = 3860222914987 is a prime.
It is a super-2 number, since 2×38602229149912 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 3860222914993, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3860222914993) 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, 1930111457495 + 1930111457496.
It is an arithmetic number, because the mean of its divisors is an integer number (1930111457496).
Almost surely, 23860222914991 is an apocalyptic number.
3860222914991 is a deficient number, since it is larger than the sum of its proper divisors (1).
3860222914991 is an equidigital number, since it uses as much as digits as its factorization.
3860222914991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3359232, while the sum is 56.
The spelling of 3860222914991 in words is "three trillion, eight hundred sixty billion, two hundred twenty-two million, nine hundred fourteen thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •