Base | Representation |
---|---|
bin | 1001101101010101101111… |
… | …0111100010110010111101 |
3 | 1101210110211200212111220021 |
4 | 2123111123313202302331 |
5 | 2344342421431031121 |
6 | 34411451431252141 |
7 | 2151131633366644 |
oct | 233253367426275 |
9 | 41713750774807 |
10 | 10674535017661 |
11 | 3446054807569 |
12 | 124496821a051 |
13 | 5c57b1947978 |
14 | 28c91640c35b |
15 | 137a085ca641 |
hex | 9b55bde2cbd |
10674535017661 has 2 divisors, whose sum is σ = 10674535017662. Its totient is φ = 10674535017660.
The previous prime is 10674535017613. The next prime is 10674535017667. The reversal of 10674535017661 is 16671053547601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5516889625636 + 5157645392025 = 2348806^2 + 2271045^2 .
It is a cyclic number.
It is not a de Polignac number, because 10674535017661 - 27 = 10674535017533 is a prime.
It is a super-2 number, since 2×106745350176612 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10674535017599 and 10674535017608.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10674535017667) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5337267508830 + 5337267508831.
It is an arithmetic number, because the mean of its divisors is an integer number (5337267508831).
Almost surely, 210674535017661 is an apocalyptic number.
It is an amenable number.
10674535017661 is a deficient number, since it is larger than the sum of its proper divisors (1).
10674535017661 is an equidigital number, since it uses as much as digits as its factorization.
10674535017661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3175200, while the sum is 52.
The spelling of 10674535017661 in words is "ten trillion, six hundred seventy-four billion, five hundred thirty-five million, seventeen thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •