Base | Representation |
---|---|
bin | 111101000000001101… |
… | …0000011001000011111 |
3 | 110112010211212202011001 |
4 | 1322000122003020133 |
5 | 4121243323043403 |
6 | 140103200011131 |
7 | 12315245640631 |
oct | 1720032031037 |
9 | 415124782131 |
10 | 131003331103 |
11 | 50615a68697 |
12 | 21480900aa7 |
13 | c479a09c88 |
14 | 64aa842a51 |
15 | 361aea1c1d |
hex | 1e8068321f |
131003331103 has 4 divisors (see below), whose sum is σ = 132275208208. Its totient is φ = 129731454000.
The previous prime is 131003331101. The next prime is 131003331113. The reversal of 131003331103 is 301133300131.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301133300131 = 877 ⋅343367503.
It is a cyclic number.
It is not a de Polignac number, because 131003331103 - 21 = 131003331101 is a prime.
It is a super-3 number, since 3×1310033311033 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131003331101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 635938398 + ... + 635938603.
It is an arithmetic number, because the mean of its divisors is an integer number (33068802052).
Almost surely, 2131003331103 is an apocalyptic number.
131003331103 is a deficient number, since it is larger than the sum of its proper divisors (1271877105).
131003331103 is a wasteful number, since it uses less digits than its factorization.
131003331103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1271877104.
The product of its (nonzero) digits is 243, while the sum is 19.
Adding to 131003331103 its reverse (301133300131), we get a palindrome (432136631234).
The spelling of 131003331103 in words is "one hundred thirty-one billion, three million, three hundred thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •