Base | Representation |
---|---|
bin | 110001000111010010000… |
… | …0101010101111000001001 |
3 | 212220022022022111100221212 |
4 | 1202032210011111320021 |
5 | 1341043300000021034 |
6 | 22204550253342505 |
7 | 1264452631302521 |
oct | 142164405257011 |
9 | 25808268440855 |
10 | 6750146485769 |
11 | 21727a2796015 |
12 | 910282497a35 |
13 | 39c6c7a07c0b |
14 | 1949cd076681 |
15 | ba8c06bd2ce |
hex | 623a4155e09 |
6750146485769 has 2 divisors, whose sum is σ = 6750146485770. Its totient is φ = 6750146485768.
The previous prime is 6750146485741. The next prime is 6750146485781. The reversal of 6750146485769 is 9675846410576.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4265071692025 + 2485074793744 = 2065205^2 + 1576412^2 .
It is a cyclic number.
It is not a de Polignac number, because 6750146485769 - 216 = 6750146420233 is a prime.
It is a super-2 number, since 2×67501464857692 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 6750146485699 and 6750146485708.
It is not a weakly prime, because it can be changed into another prime (6750146485169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3375073242884 + 3375073242885.
It is an arithmetic number, because the mean of its divisors is an integer number (3375073242885).
Almost surely, 26750146485769 is an apocalyptic number.
It is an amenable number.
6750146485769 is a deficient number, since it is larger than the sum of its proper divisors (1).
6750146485769 is an equidigital number, since it uses as much as digits as its factorization.
6750146485769 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 304819200, while the sum is 68.
The spelling of 6750146485769 in words is "six trillion, seven hundred fifty billion, one hundred forty-six million, four hundred eighty-five thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •