Base | Representation |
---|---|
bin | 11101111100001100110010… |
… | …111110010110001010011101 |
3 | 122021020111202112222212000111 |
4 | 131330030302332112022131 |
5 | 114224422131412020243 |
6 | 1144021024124130021 |
7 | 36510404352114121 |
oct | 3574146276261235 |
9 | 567214675885014 |
10 | 131680257532573 |
11 | 38a59313530832 |
12 | 12928623996911 |
13 | 5862519a92169 |
14 | 2473503901581 |
15 | 103548ba6c39d |
hex | 77c332f9629d |
131680257532573 has 4 divisors (see below), whose sum is σ = 131680325576800. Its totient is φ = 131680189488348.
The previous prime is 131680257532559. The next prime is 131680257532613. The reversal of 131680257532573 is 375235752086131.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 131680257532573 - 217 = 131680257401501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131680257532673) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 31031673 + ... + 35018926.
It is an arithmetic number, because the mean of its divisors is an integer number (32920081394200).
Almost surely, 2131680257532573 is an apocalyptic number.
It is an amenable number.
131680257532573 is a deficient number, since it is larger than the sum of its proper divisors (68044227).
131680257532573 is an equidigital number, since it uses as much as digits as its factorization.
131680257532573 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68044226.
The product of its (nonzero) digits is 31752000, while the sum is 58.
The spelling of 131680257532573 in words is "one hundred thirty-one trillion, six hundred eighty billion, two hundred fifty-seven million, five hundred thirty-two thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •