Base | Representation |
---|---|
bin | 1001000011100000011… |
… | …01011000100101110111 |
3 | 1002202001111112211021021 |
4 | 10201300031120211313 |
5 | 20044133232431403 |
6 | 354532053402011 |
7 | 31322564040544 |
oct | 4416015304567 |
9 | 1082044484237 |
10 | 311120202103 |
11 | 10aa44274777 |
12 | 50369639307 |
13 | 23452921159 |
14 | 110b5d81bcb |
15 | 815da938bd |
hex | 4870358977 |
311120202103 has 4 divisors (see below), whose sum is σ = 329421390480. Its totient is φ = 292819013728.
The previous prime is 311120202079. The next prime is 311120202167. The reversal of 311120202103 is 301202021113.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301202021113 = 7 ⋅43028860159.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-311120202103 is a prime.
It is a super-2 number, since 2×3111202021032 (a number of 24 digits) contains 22 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 (311120292103) 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, 9150594163 + ... + 9150594196.
It is an arithmetic number, because the mean of its divisors is an integer number (82355347620).
Almost surely, 2311120202103 is an apocalyptic number.
311120202103 is a deficient number, since it is larger than the sum of its proper divisors (18301188377).
311120202103 is a wasteful number, since it uses less digits than its factorization.
311120202103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18301188376.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 311120202103 its reverse (301202021113), we get a palindrome (612322223216).
The spelling of 311120202103 in words is "three hundred eleven billion, one hundred twenty million, two hundred two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •