Base | Representation |
---|---|
bin | 1001001001100101000000… |
… | …00110111111110001011111 |
3 | 2122020111001012121022200201 |
4 | 10210302200012333301133 |
5 | 10114122400112044403 |
6 | 110443051051204331 |
7 | 4144434053461525 |
oct | 444624006776137 |
9 | 78214035538621 |
10 | 20120313003103 |
11 | 6457a82178005 |
12 | 230b5501466a7 |
13 | b2c45029c631 |
14 | 4d7b84da0315 |
15 | 24d59756821d |
hex | 124ca01bfc5f |
20120313003103 has 4 divisors (see below), whose sum is σ = 20149015304808. Its totient is φ = 20091610701400.
The previous prime is 20120313003071. The next prime is 20120313003127. The reversal of 20120313003103 is 30130031302102.
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 20120313003103 - 25 = 20120313003071 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20120313003143) 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 3 ways as a sum of consecutive naturals, for example, 14351149801 + ... + 14351151202.
It is an arithmetic number, because the mean of its divisors is an integer number (5037253826202).
Almost surely, 220120313003103 is an apocalyptic number.
20120313003103 is a deficient number, since it is larger than the sum of its proper divisors (28702301705).
20120313003103 is an equidigital number, since it uses as much as digits as its factorization.
20120313003103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28702301704.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 20120313003103 its reverse (30130031302102), we get a palindrome (50250344305205).
The spelling of 20120313003103 in words is "twenty trillion, one hundred twenty billion, three hundred thirteen million, three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •