Base | Representation |
---|---|
bin | 111101010101000000… |
… | …1011110101110100001 |
3 | 110120221111200002220211 |
4 | 1322222001132232201 |
5 | 4124211043033401 |
6 | 140300340534121 |
7 | 12341454364501 |
oct | 1725201365641 |
9 | 416844602824 |
10 | 131701533601 |
11 | 5094409a550 |
12 | 216366b1341 |
13 | c55b56a151 |
14 | 653546da01 |
15 | 365c41b951 |
hex | 1eaa05eba1 |
131701533601 has 4 divisors (see below), whose sum is σ = 143674400304. Its totient is φ = 119728666900.
The previous prime is 131701533487. The next prime is 131701533611. The reversal of 131701533601 is 106335107131.
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 131701533601 - 225 = 131667979169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131701533611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5986433335 + ... + 5986433356.
It is an arithmetic number, because the mean of its divisors is an integer number (35918600076).
Almost surely, 2131701533601 is an apocalyptic number.
131701533601 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
131701533601 is a deficient number, since it is larger than the sum of its proper divisors (11972866703).
131701533601 is a wasteful number, since it uses less digits than its factorization.
131701533601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11972866702.
The product of its (nonzero) digits is 5670, while the sum is 31.
The spelling of 131701533601 in words is "one hundred thirty-one billion, seven hundred one million, five hundred thirty-three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •