Base | Representation |
---|---|
bin | 101111111110010000… |
… | …0000010010011110111 |
3 | 100211220200020212012202 |
4 | 1133330200002103313 |
5 | 3141441222114221 |
6 | 115154342535115 |
7 | 10304641560344 |
oct | 1377440022367 |
9 | 324820225182 |
10 | 103020504311 |
11 | 3a76643075a |
12 | 17b7143749b |
13 | 993a522aba |
14 | 4db42837cb |
15 | 2a2e4cdd0b |
hex | 17fc8024f7 |
103020504311 has 4 divisors (see below), whose sum is σ = 103025439672. Its totient is φ = 103015568952.
The previous prime is 103020504299. The next prime is 103020504319. The reversal of 103020504311 is 113405020301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113405020301 = 19 ⋅5968685279.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103020504311 is a prime.
It is a super-2 number, since 2×1030205043112 (a number of 23 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 (103020504319) 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, 2436236 + ... + 2478161.
It is an arithmetic number, because the mean of its divisors is an integer number (25756359918).
Almost surely, 2103020504311 is an apocalyptic number.
103020504311 is a deficient number, since it is larger than the sum of its proper divisors (4935361).
103020504311 is an equidigital number, since it uses as much as digits as its factorization.
103020504311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4935360.
The product of its (nonzero) digits is 360, while the sum is 20.
Adding to 103020504311 its reverse (113405020301), we get a palindrome (216425524612).
The spelling of 103020504311 in words is "one hundred three billion, twenty million, five hundred four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •