Base | Representation |
---|---|
bin | 111101000011011010… |
… | …1001100011001110100 |
3 | 110112102100200111100200 |
4 | 1322012311030121310 |
5 | 4122003421012020 |
6 | 140122010040500 |
7 | 12321025022604 |
oct | 1720665143164 |
9 | 415370614320 |
10 | 131111110260 |
11 | 50670892779 |
12 | 214b0a19130 |
13 | c496145520 |
14 | 64bac9ac04 |
15 | 3625691590 |
hex | 1e86d4c674 |
131111110260 has 72 divisors (see below), whose sum is σ = 428296301160. Its totient is φ = 32273503488.
The previous prime is 131111110259. The next prime is 131111110343. The reversal of 131111110260 is 62011111131.
It can be written as a sum of positive squares in 4 ways, for example, as 13662336996 + 117448773264 = 116886^2 + 342708^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 28012855 + ... + 28017534.
Almost surely, 2131111110260 is an apocalyptic number.
131111110260 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131111110260 is an abundant number, since it is smaller than the sum of its proper divisors (297185190900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131111110260 is a wasteful number, since it uses less digits than its factorization.
131111110260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56030417 (or 56030412 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 131111110260 its reverse (62011111131), we get a palindrome (193122221391).
The spelling of 131111110260 in words is "one hundred thirty-one billion, one hundred eleven million, one hundred ten thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •