Base | Representation |
---|---|
bin | 111001111110111100110… |
… | …000010110010000010101 |
3 | 112002220221201122112102221 |
4 | 321332330300112100111 |
5 | 1010240430434132234 |
6 | 12250300050102341 |
7 | 560610065461366 |
oct | 71767460262025 |
9 | 15086851575387 |
10 | 3984601474069 |
11 | 12a6950721187 |
12 | 5442aab7a9b1 |
13 | 22b991836028 |
14 | dabda219b6d |
15 | 6d9ae1c3eb4 |
hex | 39fbcc16415 |
3984601474069 has 2 divisors, whose sum is σ = 3984601474070. Its totient is φ = 3984601474068.
The previous prime is 3984601473971. The next prime is 3984601474109. The reversal of 3984601474069 is 9604741064893.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3984115800625 + 485673444 = 1996025^2 + 22038^2 .
It is a cyclic number.
It is not a de Polignac number, because 3984601474069 - 29 = 3984601473557 is a prime.
It is a super-2 number, since 2×39846014740692 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3984601473998 and 3984601474016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3984601478069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1992300737034 + 1992300737035.
It is an arithmetic number, because the mean of its divisors is an integer number (1992300737035).
Almost surely, 23984601474069 is an apocalyptic number.
It is an amenable number.
3984601474069 is a deficient number, since it is larger than the sum of its proper divisors (1).
3984601474069 is an equidigital number, since it uses as much as digits as its factorization.
3984601474069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 31352832, while the sum is 61.
The spelling of 3984601474069 in words is "three trillion, nine hundred eighty-four billion, six hundred one million, four hundred seventy-four thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •