Base | Representation |
---|---|
bin | 111101001010000001… |
… | …1101000101110100101 |
3 | 110112222211012122222221 |
4 | 1322110003220232211 |
5 | 4122432222000401 |
6 | 140200013552341 |
7 | 12326361040012 |
oct | 1722403505645 |
9 | 415884178887 |
10 | 131333000101 |
11 | 50775066906 |
12 | 215531a56b1 |
13 | c5000c51a4 |
14 | 64dc53a709 |
15 | 3639dc17a1 |
hex | 1e940e8ba5 |
131333000101 has 4 divisors (see below), whose sum is σ = 132138724192. Its totient is φ = 130527276012.
The previous prime is 131333000093. The next prime is 131333000137. The reversal of 131333000101 is 101000333131.
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, and also an emirpimes, since its reverse is a distinct semiprime: 101000333131 = 23669 ⋅4267199.
It is a cyclic number.
It is not a de Polignac number, because 131333000101 - 23 = 131333000093 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 (131333000171) 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, 402861801 + ... + 402862126.
It is an arithmetic number, because the mean of its divisors is an integer number (33034681048).
Almost surely, 2131333000101 is an apocalyptic number.
It is an amenable number.
131333000101 is a deficient number, since it is larger than the sum of its proper divisors (805724091).
131333000101 is an equidigital number, since it uses as much as digits as its factorization.
131333000101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 805724090.
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 131333000101 its reverse (101000333131), we get a palindrome (232333333232).
The spelling of 131333000101 in words is "one hundred thirty-one billion, three hundred thirty-three million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •