Base | Representation |
---|---|
bin | 111000001111110011110… |
… | …110100000000111110101 |
3 | 111200111221002022102212121 |
4 | 320033303312200013311 |
5 | 1001312031241444231 |
6 | 12115402400515541 |
7 | 546153625164652 |
oct | 70176366400765 |
9 | 14614832272777 |
10 | 3865266749941 |
11 | 1260283349733 |
12 | 52514601bbb1 |
13 | 220654420a2c |
14 | d51193acc29 |
15 | 6a827832311 |
hex | 383f3da01f5 |
3865266749941 has 2 divisors, whose sum is σ = 3865266749942. Its totient is φ = 3865266749940.
The previous prime is 3865266749917. The next prime is 3865266749951. The reversal of 3865266749941 is 1499476625683.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3800511260100 + 64755489841 = 1949490^2 + 254471^2 .
It is a cyclic number.
It is not a de Polignac number, because 3865266749941 - 229 = 3864729879029 is a prime.
It is a super-2 number, since 2×38652667499412 (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 (3865266749951) 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, 1932633374970 + 1932633374971.
It is an arithmetic number, because the mean of its divisors is an integer number (1932633374971).
Almost surely, 23865266749941 is an apocalyptic number.
It is an amenable number.
3865266749941 is a deficient number, since it is larger than the sum of its proper divisors (1).
3865266749941 is an equidigital number, since it uses as much as digits as its factorization.
3865266749941 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 470292480, while the sum is 70.
The spelling of 3865266749941 in words is "three trillion, eight hundred sixty-five billion, two hundred sixty-six million, seven hundred forty-nine thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •