Base | Representation |
---|---|
bin | 1110110100010010… |
… | …1011001110010101 |
3 | 101021012020011111011 |
4 | 3231010223032111 |
5 | 31121210111223 |
6 | 1454402012221 |
7 | 200364363424 |
oct | 35504531625 |
9 | 11235204434 |
10 | 3977425813 |
11 | 1761175979 |
12 | 930047071 |
13 | 4b50496ca |
14 | 29a3592bb |
15 | 1842b680d |
hex | ed12b395 |
3977425813 has 4 divisors (see below), whose sum is σ = 3984044428. Its totient is φ = 3970807200.
The previous prime is 3977425783. The next prime is 3977425831. The reversal of 3977425813 is 3185247793.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1348505284 + 2628920529 = 36722^2 + 51273^2 .
It is a cyclic number.
It is not a de Polignac number, because 3977425813 - 29 = 3977425301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3977420813) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3308406 + ... + 3309607.
It is an arithmetic number, because the mean of its divisors is an integer number (996011107).
Almost surely, 23977425813 is an apocalyptic number.
It is an amenable number.
3977425813 is a deficient number, since it is larger than the sum of its proper divisors (6618615).
3977425813 is an equidigital number, since it uses as much as digits as its factorization.
3977425813 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6618614.
The product of its digits is 1270080, while the sum is 49.
The square root of 3977425813 is about 63066.8360788775. The cubic root of 3977425813 is about 1584.4092260374.
The spelling of 3977425813 in words is "three billion, nine hundred seventy-seven million, four hundred twenty-five thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •