Base | Representation |
---|---|
bin | 110000000001100010… |
… | …1111110011001000111 |
3 | 100212012101101100212000 |
4 | 1200003011332121013 |
5 | 3142203031104111 |
6 | 115213333400343 |
7 | 10310453665632 |
oct | 1400305763107 |
9 | 325171340760 |
10 | 103131113031 |
11 | 3a812908721 |
12 | 17ba24990b3 |
13 | 995740c24b |
14 | 4dc4c36c19 |
15 | 2a3907bc56 |
hex | 180317e647 |
103131113031 has 16 divisors (see below), whose sum is σ = 152794898400. Its totient is φ = 68750446464.
The previous prime is 103131113009. The next prime is 103131113081. The reversal of 103131113031 is 130311131301.
It is not a de Polignac number, because 103131113031 - 211 = 103131110983 is a prime.
It is a super-2 number, since 2×1031311130312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103131112995 and 103131113013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103131113081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 481345 + ... + 661781.
It is an arithmetic number, because the mean of its divisors is an integer number (9549681150).
Almost surely, 2103131113031 is an apocalyptic number.
103131113031 is a deficient number, since it is larger than the sum of its proper divisors (49663785369).
103131113031 is a wasteful number, since it uses less digits than its factorization.
103131113031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201615 (or 201609 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 18.
Adding to 103131113031 its reverse (130311131301), we get a palindrome (233442244332).
The spelling of 103131113031 in words is "one hundred three billion, one hundred thirty-one million, one hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •