Base | Representation |
---|---|
bin | 111101000011001001… |
… | …0100001010111111000 |
3 | 110112101201120201101120 |
4 | 1322012102201113320 |
5 | 4121444104133422 |
6 | 140121043145240 |
7 | 12320554535616 |
oct | 1720622412770 |
9 | 415351521346 |
10 | 131102021112 |
11 | 50666744987 |
12 | 214a9975220 |
13 | c4942b242a |
14 | 64b99b26b6 |
15 | 362499845c |
hex | 1e864a15f8 |
131102021112 has 32 divisors (see below), whose sum is σ = 330113011200. Its totient is φ = 43386279264.
The previous prime is 131102021053. The next prime is 131102021129. The reversal of 131102021112 is 211120201131.
It is a super-3 number, since 3×1311020211123 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131102021091 and 131102021100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19646248 + ... + 19652919.
It is an arithmetic number, because the mean of its divisors is an integer number (10316031600).
Almost surely, 2131102021112 is an apocalyptic number.
131102021112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
131102021112 is an abundant number, since it is smaller than the sum of its proper divisors (199010990088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131102021112 is a wasteful number, since it uses less digits than its factorization.
131102021112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39299315 (or 39299311 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 131102021112 its reverse (211120201131), we get a palindrome (342222222243).
The spelling of 131102021112 in words is "one hundred thirty-one billion, one hundred two million, twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •