Base | Representation |
---|---|
bin | 111001111110010000110… |
… | …110011010000100101111 |
3 | 112002212001101120220212012 |
4 | 321332100312122010233 |
5 | 1010232423401140241 |
6 | 12250055014031435 |
7 | 560552612424320 |
oct | 71762066320457 |
9 | 15085041526765 |
10 | 3983864865071 |
11 | 12a6602947a13 |
12 | 54412434857b |
13 | 22b8a5049710 |
14 | dab6a472447 |
15 | 6d9696be6eb |
hex | 39f90d9a12f |
3983864865071 has 64 divisors (see below), whose sum is σ = 5365633351680. Its totient is φ = 2867462830080.
The previous prime is 3983864865067. The next prime is 3983864865089. The reversal of 3983864865071 is 1705684683893.
It is a cyclic number.
It is not a de Polignac number, because 3983864865071 - 22 = 3983864865067 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3983864864992 and 3983864865010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3983864865041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 39706250 + ... + 39806456.
It is an arithmetic number, because the mean of its divisors is an integer number (83838021120).
Almost surely, 23983864865071 is an apocalyptic number.
3983864865071 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
3983864865071 is a deficient number, since it is larger than the sum of its proper divisors (1381768486609).
3983864865071 is a wasteful number, since it uses less digits than its factorization.
3983864865071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101104.
The product of its (nonzero) digits is 209018880, while the sum is 68.
The spelling of 3983864865071 in words is "three trillion, nine hundred eighty-three billion, eight hundred sixty-four million, eight hundred sixty-five thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •