Base | Representation |
---|---|
bin | 111000111100111001010… |
… | …001010111010000001101 |
3 | 111212010212210222011122122 |
4 | 320330321101113100031 |
5 | 1003110202032402121 |
6 | 12153530140222325 |
7 | 552516353423504 |
oct | 70747121272015 |
9 | 14763783864578 |
10 | 3913676059661 |
11 | 1279865119615 |
12 | 5325b623a9a5 |
13 | 22509a7672b4 |
14 | d75cc74d83b |
15 | 6bc0c7165ab |
hex | 38f3945740d |
3913676059661 has 2 divisors, whose sum is σ = 3913676059662. Its totient is φ = 3913676059660.
The previous prime is 3913676059591. The next prime is 3913676059687. The reversal of 3913676059661 is 1669506763193.
3913676059661 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2521585202500 + 1392090857161 = 1587950^2 + 1179869^2 .
It is a cyclic number.
It is not a de Polignac number, because 3913676059661 - 210 = 3913676058637 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3913676059594 and 3913676059603.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3913676052661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1956838029830 + 1956838029831.
It is an arithmetic number, because the mean of its divisors is an integer number (1956838029831).
Almost surely, 23913676059661 is an apocalyptic number.
It is an amenable number.
3913676059661 is a deficient number, since it is larger than the sum of its proper divisors (1).
3913676059661 is an equidigital number, since it uses as much as digits as its factorization.
3913676059661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 33067440, while the sum is 62.
The spelling of 3913676059661 in words is "three trillion, nine hundred thirteen billion, six hundred seventy-six million, fifty-nine thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •