Base | Representation |
---|---|
bin | 1111100111011… |
… | …10011011001101 |
3 | 100010111111020100 |
4 | 13303232123031 |
5 | 232014000023 |
6 | 20555441313 |
7 | 3150324144 |
oct | 763563315 |
9 | 303444210 |
10 | 131000013 |
11 | 67a45281 |
12 | 37a56239 |
13 | 211a8a01 |
14 | 1358075b |
15 | b779c43 |
hex | 7cee6cd |
131000013 has 12 divisors (see below), whose sum is σ = 189327580. Its totient is φ = 87284736.
The previous prime is 130999997. The next prime is 131000021. The reversal of 131000013 is 310000131.
It can be written as a sum of positive squares in 2 ways, for example, as 14424804 + 116575209 = 3798^2 + 10797^2 .
It is not a de Polignac number, because 131000013 - 24 = 130999997 is a prime.
It is a super-2 number, since 2×1310000132 = 34322006812000338, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130999959 and 131000004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131000713) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 21495 + ... + 26907.
Almost surely, 2131000013 is an apocalyptic number.
It is an amenable number.
131000013 is a deficient number, since it is larger than the sum of its proper divisors (58327567).
131000013 is a wasteful number, since it uses less digits than its factorization.
131000013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8108 (or 8105 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 9.
The square root of 131000013 is about 11445.5237101672. The cubic root of 131000013 is about 507.8753246132.
Adding to 131000013 its reverse (310000131), we get a palindrome (441000144).
The spelling of 131000013 in words is "one hundred thirty-one million, thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •