Base | Representation |
---|---|
bin | 111101000110011011… |
… | …1110000110000101001 |
3 | 110112200102100220220102 |
4 | 1322030313300300221 |
5 | 4122210341244021 |
6 | 140140030035145 |
7 | 12323365252364 |
oct | 1721467606051 |
9 | 415612326812 |
10 | 131212446761 |
11 | 50713007350 |
12 | 2151a948ab5 |
13 | c4b1136456 |
14 | 64ca5190db |
15 | 362e50c00b |
hex | 1e8cdf0c29 |
131212446761 has 16 divisors (see below), whose sum is σ = 144422308800. Its totient is φ = 118218547200.
The previous prime is 131212446727. The next prime is 131212446767. The reversal of 131212446761 is 167644212131.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131212446761 is a prime.
It is a super-2 number, since 2×1312124467612 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (131212446767) 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 15 ways as a sum of consecutive naturals, for example, 1048925 + ... + 1167333.
It is an arithmetic number, because the mean of its divisors is an integer number (9026394300).
Almost surely, 2131212446761 is an apocalyptic number.
131212446761 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
131212446761 is a deficient number, since it is larger than the sum of its proper divisors (13209862039).
131212446761 is a wasteful number, since it uses less digits than its factorization.
131212446761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119320.
The product of its digits is 48384, while the sum is 38.
Adding to 131212446761 its reverse (167644212131), we get a palindrome (298856658892).
The spelling of 131212446761 in words is "one hundred thirty-one billion, two hundred twelve million, four hundred forty-six thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •