Base | Representation |
---|---|
bin | 111000110110001100100… |
… | …101100110100001101101 |
3 | 111211110022120201121110112 |
4 | 320312030211212201231 |
5 | 1003000434342030222 |
6 | 12150340340145405 |
7 | 552143212416122 |
oct | 70661445464155 |
9 | 14743276647415 |
10 | 3906483939437 |
11 | 1276804384202 |
12 | 531129698265 |
13 | 2244c2705861 |
14 | d71094a2749 |
15 | 6b93b0ecbe2 |
hex | 38d8c96686d |
3906483939437 has 2 divisors, whose sum is σ = 3906483939438. Its totient is φ = 3906483939436.
The previous prime is 3906483939389. The next prime is 3906483939439. The reversal of 3906483939437 is 7349393846093.
3906483939437 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., 3905548252516 + 935686921 = 1976246^2 + 30589^2 .
It is a cyclic number.
It is not a de Polignac number, because 3906483939437 - 220 = 3906482890861 is a prime.
Together with 3906483939439, 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 (3906483939439) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1953241969718 + 1953241969719.
It is an arithmetic number, because the mean of its divisors is an integer number (1953241969719).
Almost surely, 23906483939437 is an apocalyptic number.
It is an amenable number.
3906483939437 is a deficient number, since it is larger than the sum of its proper divisors (1).
3906483939437 is an equidigital number, since it uses as much as digits as its factorization.
3906483939437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 317447424, while the sum is 68.
The spelling of 3906483939437 in words is "three trillion, nine hundred six billion, four hundred eighty-three million, nine hundred thirty-nine thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •