Base | Representation |
---|---|
bin | 101111000101011001… |
… | …1111111000000000100 |
3 | 100122222202012020221020 |
4 | 1132022303333000010 |
5 | 3124034430143022 |
6 | 114241205151140 |
7 | 10206451301265 |
oct | 1361263770004 |
9 | 318882166836 |
10 | 101113131012 |
11 | 399777a9993 |
12 | 1771a6bb4b0 |
13 | 96c530a14a |
14 | 4c72c1a96c |
15 | 296bd1635c |
hex | 178acff004 |
101113131012 has 48 divisors (see below), whose sum is σ = 250355770560. Its totient is φ = 31652324352.
The previous prime is 101113130953. The next prime is 101113131019. The reversal of 101113131012 is 210131311101.
It is a super-2 number, since 2×1011131310122 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101113130982 and 101113131000.
It is not an unprimeable number, because it can be changed into a prime (101113131019) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 449062 + ... + 635517.
It is an arithmetic number, because the mean of its divisors is an integer number (5215745220).
Almost surely, 2101113131012 is an apocalyptic number.
101113131012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101113131012 is an abundant number, since it is smaller than the sum of its proper divisors (149242639548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101113131012 is a wasteful number, since it uses less digits than its factorization.
101113131012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1085060 (or 1085058 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 101113131012 its reverse (210131311101), we get a palindrome (311244442113).
The spelling of 101113131012 in words is "one hundred one billion, one hundred thirteen million, one hundred thirty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •