Base | Representation |
---|---|
bin | 101111111110001111… |
… | …1010011001100000111 |
3 | 100211220122220001110022 |
4 | 1133330133103030013 |
5 | 3141441144430203 |
6 | 115154334445355 |
7 | 10304640124550 |
oct | 1377437231407 |
9 | 324818801408 |
10 | 103020311303 |
11 | 3a766309748 |
12 | 17b7136385b |
13 | 993a485cb0 |
14 | 4db4233327 |
15 | 2a2e491a38 |
hex | 17fc7d3307 |
103020311303 has 16 divisors (see below), whose sum is σ = 126802218816. Its totient is φ = 81505440000.
The previous prime is 103020311281. The next prime is 103020311309. The reversal of 103020311303 is 303113020301.
It is a cyclic number.
It is not a de Polignac number, because 103020311303 - 26 = 103020311239 is a prime.
It is a super-2 number, since 2×1030203113032 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103020311309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2145053 + ... + 2192553.
It is an arithmetic number, because the mean of its divisors is an integer number (7925138676).
Almost surely, 2103020311303 is an apocalyptic number.
103020311303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
103020311303 is a deficient number, since it is larger than the sum of its proper divisors (23781907513).
103020311303 is a wasteful number, since it uses less digits than its factorization.
103020311303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71354.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 103020311303 its reverse (303113020301), we get a palindrome (406133331604).
The spelling of 103020311303 in words is "one hundred three billion, twenty million, three hundred eleven thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •