Base | Representation |
---|---|
bin | 1001001011111010000011… |
… | …00000110011010101100101 |
3 | 2122112010120202021201200101 |
4 | 10211331001200303111211 |
5 | 10121430234024423023 |
6 | 110543523103544101 |
7 | 4153266005410516 |
oct | 445750140632545 |
9 | 78463522251611 |
10 | 20200330311013 |
11 | 6488a03925846 |
12 | 2322b618bb031 |
13 | b36b62b843c8 |
14 | 4db9b6162a0d |
15 | 2506cc3051ad |
hex | 125f41833565 |
20200330311013 has 8 divisors (see below), whose sum is σ = 21264166776320. Its totient is φ = 19136559964320.
The previous prime is 20200330311001. The next prime is 20200330311047. The reversal of 20200330311013 is 31011303300202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20200330311013 - 25 = 20200330310981 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20200330011013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15901920 + ... + 17125177.
It is an arithmetic number, because the mean of its divisors is an integer number (2658020847040).
Almost surely, 220200330311013 is an apocalyptic number.
It is an amenable number.
20200330311013 is a deficient number, since it is larger than the sum of its proper divisors (1063836465307).
20200330311013 is a wasteful number, since it uses less digits than its factorization.
20200330311013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33059307.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 20200330311013 its reverse (31011303300202), we get a palindrome (51211633611215).
The spelling of 20200330311013 in words is "twenty trillion, two hundred billion, three hundred thirty million, three hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.164 sec. • engine limits •