Base | Representation |
---|---|
bin | 100100011000101101111111… |
… | …1100011010111001110100101 |
3 | 1112222020010011221222211122212 |
4 | 1020301123333203113032211 |
5 | 313422302020032023324 |
6 | 3052411555555533205 |
7 | 124262221260252215 |
oct | 11061337743271645 |
9 | 1488203157884585 |
10 | 320056660423589 |
11 | 92a862a3a49411 |
12 | 2ba9115bbba205 |
13 | 109782a12b78cb |
14 | 5906b79bc8245 |
15 | 270061cb7870e |
hex | 12316ff8d73a5 |
320056660423589 has 2 divisors, whose sum is σ = 320056660423590. Its totient is φ = 320056660423588.
The previous prime is 320056660423579. The next prime is 320056660423601. The reversal of 320056660423589 is 985324066650023.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 280563605501089 + 39493054922500 = 16750033^2 + 6284350^2 .
It is a cyclic number.
It is not a de Polignac number, because 320056660423589 - 212 = 320056660419493 is a prime.
It is a super-2 number, since 2×3200566604235892 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (320056660423579) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160028330211794 + 160028330211795.
It is an arithmetic number, because the mean of its divisors is an integer number (160028330211795).
Almost surely, 2320056660423589 is an apocalyptic number.
It is an amenable number.
320056660423589 is a deficient number, since it is larger than the sum of its proper divisors (1).
320056660423589 is an equidigital number, since it uses as much as digits as its factorization.
320056660423589 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 55987200, while the sum is 59.
The spelling of 320056660423589 in words is "three hundred twenty trillion, fifty-six billion, six hundred sixty million, four hundred twenty-three thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •