Base | Representation |
---|---|
bin | 101111111101111110… |
… | …0010010011100101111 |
3 | 100211220000121202111201 |
4 | 1133323330102130233 |
5 | 3141431322230411 |
6 | 115153410030331 |
7 | 10304466120406 |
oct | 1377374223457 |
9 | 324800552451 |
10 | 103011133231 |
11 | 3a761110066 |
12 | 17b6a2783a7 |
13 | 99385c1596 |
14 | 4db2d2463d |
15 | 2a2d77c3c1 |
hex | 17fbf1272f |
103011133231 has 4 divisors (see below), whose sum is σ = 103012382200. Its totient is φ = 103009884264.
The previous prime is 103011133217. The next prime is 103011133279. The reversal of 103011133231 is 132331110301.
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 103011133231 - 227 = 102876915503 is a prime.
It is a super-2 number, since 2×1030111332312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103011133199 and 103011133208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103011133331) 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, 491301 + ... + 668878.
It is an arithmetic number, because the mean of its divisors is an integer number (25753095550).
Almost surely, 2103011133231 is an apocalyptic number.
103011133231 is a deficient number, since it is larger than the sum of its proper divisors (1248969).
103011133231 is an equidigital number, since it uses as much as digits as its factorization.
103011133231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1248968.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 103011133231 its reverse (132331110301), we get a palindrome (235342243532).
The spelling of 103011133231 in words is "one hundred three billion, eleven million, one hundred thirty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •