Base | Representation |
---|---|
bin | 111001000011011011010… |
… | …110101110101000111101 |
3 | 111212210222122120122202111 |
4 | 321003123112232220331 |
5 | 1003214033211424321 |
6 | 12201050144454021 |
7 | 553155235020544 |
oct | 71033326565075 |
9 | 14783878518674 |
10 | 3920690342461 |
11 | 1281834539052 |
12 | 533a3331a311 |
13 | 225947a012a9 |
14 | d7a9614715b |
15 | 6bebd4025e1 |
hex | 390db5aea3d |
3920690342461 has 2 divisors, whose sum is σ = 3920690342462. Its totient is φ = 3920690342460.
The previous prime is 3920690342449. The next prime is 3920690342507. The reversal of 3920690342461 is 1642430960293.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3919410062500 + 1280279961 = 1979750^2 + 35781^2 .
It is an emirp because it is prime and its reverse (1642430960293) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3920690342461 is a prime.
It is a super-2 number, since 2×39206903424612 (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 (3920690342411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1960345171230 + 1960345171231.
It is an arithmetic number, because the mean of its divisors is an integer number (1960345171231).
Almost surely, 23920690342461 is an apocalyptic number.
It is an amenable number.
3920690342461 is a deficient number, since it is larger than the sum of its proper divisors (1).
3920690342461 is an equidigital number, since it uses as much as digits as its factorization.
3920690342461 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1679616, while the sum is 49.
The spelling of 3920690342461 in words is "three trillion, nine hundred twenty billion, six hundred ninety million, three hundred forty-two thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •