Base | Representation |
---|---|
bin | 111001101011000010010… |
… | …000111011110001100101 |
3 | 112000212202112212122202202 |
4 | 321223002100323301211 |
5 | 1004413133040102312 |
6 | 12232402214544245 |
7 | 556222156141214 |
oct | 71530220736145 |
9 | 15025675778682 |
10 | 3963219065957 |
11 | 1298878929518 |
12 | 540122068085 |
13 | 22996492bc38 |
14 | d9b6c4c107b |
15 | 6d15bdda9c2 |
hex | 39ac243bc65 |
3963219065957 has 2 divisors, whose sum is σ = 3963219065958. Its totient is φ = 3963219065956.
The previous prime is 3963219065917. The next prime is 3963219066017. The reversal of 3963219065957 is 7595609123693.
3963219065957 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3946106763361 + 17112302596 = 1986481^2 + 130814^2 .
It is a cyclic number.
It is not a de Polignac number, because 3963219065957 - 26 = 3963219065893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3963219065893 and 3963219065902.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3963219065917) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1981609532978 + 1981609532979.
It is an arithmetic number, because the mean of its divisors is an integer number (1981609532979).
Almost surely, 23963219065957 is an apocalyptic number.
It is an amenable number.
3963219065957 is a deficient number, since it is larger than the sum of its proper divisors (1).
3963219065957 is an equidigital number, since it uses as much as digits as its factorization.
3963219065957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 82668600, while the sum is 65.
The spelling of 3963219065957 in words is "three trillion, nine hundred sixty-three billion, two hundred nineteen million, sixty-five thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •