Base | Representation |
---|---|
bin | 110000000110111010… |
… | …0101001011100000011 |
3 | 100212122221002200011122 |
4 | 1200031310221130003 |
5 | 3143040121321011 |
6 | 115243243502455 |
7 | 10315101013652 |
oct | 1401564513403 |
9 | 325587080148 |
10 | 103311120131 |
11 | 3a8a548571a |
12 | 18032827a2b |
13 | 99857b641b |
14 | 5000ad3199 |
15 | 2a49c873db |
hex | 180dd29703 |
103311120131 has 4 divisors (see below), whose sum is σ = 103349287272. Its totient is φ = 103272952992.
The previous prime is 103311120103. The next prime is 103311120161. The reversal of 103311120131 is 131021113301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131021113301 = 13 ⋅10078547177.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103311120131 is a prime.
It is a super-2 number, since 2×1033111201312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103311120161) 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, 19079510 + ... + 19084923.
It is an arithmetic number, because the mean of its divisors is an integer number (25837321818).
Almost surely, 2103311120131 is an apocalyptic number.
103311120131 is a deficient number, since it is larger than the sum of its proper divisors (38167141).
103311120131 is an equidigital number, since it uses as much as digits as its factorization.
103311120131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38167140.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 103311120131 its reverse (131021113301), we get a palindrome (234332233432).
The spelling of 103311120131 in words is "one hundred three billion, three hundred eleven million, one hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •