Base | Representation |
---|---|
bin | 111101001001111100… |
… | …0100101100000001111 |
3 | 110112222121202111100102 |
4 | 1322103320211200033 |
5 | 4122431001301221 |
6 | 140155431521315 |
7 | 12326324313401 |
oct | 1722370454017 |
9 | 415877674312 |
10 | 131330103311 |
11 | 50773468470 |
12 | 2155222923b |
13 | c4cc61c804 |
14 | 64dbdc4b71 |
15 | 36399ed30b |
hex | 1e93e2580f |
131330103311 has 4 divisors (see below), whose sum is σ = 143269203624. Its totient is φ = 119391003000.
The previous prime is 131330103269. The next prime is 131330103391. The reversal of 131330103311 is 113301033131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131330103311 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 (131330103391) 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, 5969550140 + ... + 5969550161.
It is an arithmetic number, because the mean of its divisors is an integer number (35817300906).
Almost surely, 2131330103311 is an apocalyptic number.
131330103311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
131330103311 is a deficient number, since it is larger than the sum of its proper divisors (11939100313).
131330103311 is a wasteful number, since it uses less digits than its factorization.
131330103311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11939100312.
The product of its (nonzero) digits is 243, while the sum is 20.
Adding to 131330103311 its reverse (113301033131), we get a palindrome (244631136442).
The spelling of 131330103311 in words is "one hundred thirty-one billion, three hundred thirty million, one hundred three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •