Base | Representation |
---|---|
bin | 1001001011111010000000… |
… | …11011110000111100110111 |
3 | 2122112010112111020021021211 |
4 | 10211331000123300330313 |
5 | 10121430214411311203 |
6 | 110543521220022251 |
7 | 4153265365523515 |
oct | 445750033607467 |
9 | 78463474207254 |
10 | 20200312213303 |
11 | 64889a4694762 |
12 | 2322b57831987 |
13 | b36b5c1b8ac1 |
14 | 4db9b39b14b5 |
15 | 2506ca92cc6d |
hex | 125f406f0f37 |
20200312213303 has 4 divisors (see below), whose sum is σ = 20203519127400. Its totient is φ = 20197105299208.
The previous prime is 20200312213283. The next prime is 20200312213307. The reversal of 20200312213303 is 30331221300202.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20200312213303 is a prime.
It is a super-2 number, since 2×202003122133032 (a number of 27 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 (20200312213307) 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, 1603447600 + ... + 1603460197.
It is an arithmetic number, because the mean of its divisors is an integer number (5050879781850).
Almost surely, 220200312213303 is an apocalyptic number.
20200312213303 is a deficient number, since it is larger than the sum of its proper divisors (3206914097).
20200312213303 is an equidigital number, since it uses as much as digits as its factorization.
20200312213303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3206914096.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 20200312213303 its reverse (30331221300202), we get a palindrome (50531533513505).
The spelling of 20200312213303 in words is "twenty trillion, two hundred billion, three hundred twelve million, two hundred thirteen thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •