Base | Representation |
---|---|
bin | 110000000001100010… |
… | …1111101111110001111 |
3 | 100212012101101021111022 |
4 | 1200003011331332033 |
5 | 3142203031030221 |
6 | 115213333344355 |
7 | 10310453660624 |
oct | 1400305757617 |
9 | 325171337438 |
10 | 103131111311 |
11 | 3a8129073a8 |
12 | 17ba24980bb |
13 | 995740b527 |
14 | 4dc4c3634b |
15 | 2a3907b4ab |
hex | 180317df8f |
103131111311 has 4 divisors (see below), whose sum is σ = 103498126224. Its totient is φ = 102764096400.
The previous prime is 103131111287. The next prime is 103131111331. The reversal of 103131111311 is 113111131301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 103131111311 - 222 = 103126917007 is a prime.
It is a super-2 number, since 2×1031311113112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103131111311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103131111331) 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, 183507035 + ... + 183507596.
It is an arithmetic number, because the mean of its divisors is an integer number (25874531556).
Almost surely, 2103131111311 is an apocalyptic number.
103131111311 is a deficient number, since it is larger than the sum of its proper divisors (367014913).
103131111311 is an equidigital number, since it uses as much as digits as its factorization.
103131111311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 367014912.
The product of its (nonzero) digits is 27, while the sum is 17.
Adding to 103131111311 its reverse (113111131301), we get a palindrome (216242242612).
The spelling of 103131111311 in words is "one hundred three billion, one hundred thirty-one million, one hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •