Base | Representation |
---|---|
bin | 110000100011111100110… |
… | …1011100001010011010101 |
3 | 212122001110120102100200021 |
4 | 1201013321223201103111 |
5 | 1333322402411133234 |
6 | 22110041352345141 |
7 | 1256125465455514 |
oct | 141077153412325 |
9 | 25561416370607 |
10 | 6674273146069 |
11 | 21435a82139a1 |
12 | 8b96286a51b1 |
13 | 3954c5811139 |
14 | 1910723c267b |
15 | b892e6439b4 |
hex | 611f9ae14d5 |
6674273146069 has 2 divisors, whose sum is σ = 6674273146070. Its totient is φ = 6674273146068.
The previous prime is 6674273146003. The next prime is 6674273146081. The reversal of 6674273146069 is 9606413724766.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3670048253169 + 3004224892900 = 1915737^2 + 1733270^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6674273146069 is a prime.
It is a super-2 number, since 2×66742731460692 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 6674273145998 and 6674273146016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6674273144069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3337136573034 + 3337136573035.
It is an arithmetic number, because the mean of its divisors is an integer number (3337136573035).
Almost surely, 26674273146069 is an apocalyptic number.
It is an amenable number.
6674273146069 is a deficient number, since it is larger than the sum of its proper divisors (1).
6674273146069 is an equidigital number, since it uses as much as digits as its factorization.
6674273146069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54867456, while the sum is 61.
The spelling of 6674273146069 in words is "six trillion, six hundred seventy-four billion, two hundred seventy-three million, one hundred forty-six thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •