Base | Representation |
---|---|
bin | 111001110110011000011… |
… | …001000111000000111111 |
3 | 112002001012120012210122012 |
4 | 321312120121013000333 |
5 | 1010113110233433332 |
6 | 12242135122041435 |
7 | 560133103636226 |
oct | 71663031070077 |
9 | 15061176183565 |
10 | 3975401467967 |
11 | 12a2a5a543456 |
12 | 542561aa927b |
13 | 22ab567c8a37 |
14 | da5a641dcbd |
15 | 6d62168b3b2 |
hex | 39d9864703f |
3975401467967 has 2 divisors, whose sum is σ = 3975401467968. Its totient is φ = 3975401467966.
The previous prime is 3975401467957. The next prime is 3975401468069. The reversal of 3975401467967 is 7697641045793.
3975401467967 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 3975401467967 - 216 = 3975401402431 is a prime.
It is a super-2 number, since 2×39754014679672 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3975401467897 and 3975401467906.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3975401467927) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1987700733983 + 1987700733984.
It is an arithmetic number, because the mean of its divisors is an integer number (1987700733984).
Almost surely, 23975401467967 is an apocalyptic number.
3975401467967 is a deficient number, since it is larger than the sum of its proper divisors (1).
3975401467967 is an equidigital number, since it uses as much as digits as its factorization.
3975401467967 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 240045120, while the sum is 68.
The spelling of 3975401467967 in words is "three trillion, nine hundred seventy-five billion, four hundred one million, four hundred sixty-seven thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •