Base | Representation |
---|---|
bin | 111101001011001101… |
… | …0101110011001100001 |
3 | 110120002120201220112211 |
4 | 1322112122232121201 |
5 | 4123022341411243 |
6 | 140203550522121 |
7 | 12330351510151 |
oct | 1722632563141 |
9 | 416076656484 |
10 | 131372607073 |
11 | 50795459144 |
12 | 21564506341 |
13 | c508381b76 |
14 | 65038ca761 |
15 | 363d5e6d9d |
hex | 1e966ae661 |
131372607073 has 4 divisors (see below), whose sum is σ = 131373648900. Its totient is φ = 131371565248.
The previous prime is 131372607029. The next prime is 131372607077. The reversal of 131372607073 is 370706273131.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 370706273131 = 37 ⋅10019088463.
It can be written as a sum of positive squares in 2 ways, for example, as 122687671824 + 8684935249 = 350268^2 + 93193^2 .
It is a cyclic number.
It is not a de Polignac number, because 131372607073 - 213 = 131372598881 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131372607077) 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, 300748 + ... + 594301.
It is an arithmetic number, because the mean of its divisors is an integer number (32843412225).
Almost surely, 2131372607073 is an apocalyptic number.
It is an amenable number.
131372607073 is a deficient number, since it is larger than the sum of its proper divisors (1041827).
131372607073 is an equidigital number, since it uses as much as digits as its factorization.
131372607073 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1041826.
The product of its (nonzero) digits is 111132, while the sum is 40.
The spelling of 131372607073 in words is "one hundred thirty-one billion, three hundred seventy-two million, six hundred seven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •