Search a number
-
+
20013311013 = 317392417863
BaseRepresentation
bin10010101000111000…
…101110010000100101
31220122202120112112020
4102220320232100211
5311441401423023
613105522413353
71305643223343
oct225070562045
956582515466
1020013311013
11853aaa0863
123a66501259
131b6c388587
14d7bd8c993
157c1ee9de3
hex4a8e2e425

20013311013 has 8 divisors (see below), whose sum is σ = 28254086208. Its totient is φ = 12557371584.

The previous prime is 20013310981. The next prime is 20013311023. The reversal of 20013311013 is 31011331002.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 20013311013 - 25 = 20013310981 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 20013310983 and 20013311001.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (20013311023) 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, 196208881 + ... + 196208982.

It is an arithmetic number, because the mean of its divisors is an integer number (3531760776).

Almost surely, 220013311013 is an apocalyptic number.

It is an amenable number.

20013311013 is a deficient number, since it is larger than the sum of its proper divisors (8240775195).

20013311013 is a wasteful number, since it uses less digits than its factorization.

20013311013 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 392417883.

The product of its (nonzero) digits is 54, while the sum is 15.

Adding to 20013311013 its reverse (31011331002), we get a palindrome (51024642015).

The spelling of 20013311013 in words is "twenty billion, thirteen million, three hundred eleven thousand, thirteen".

Divisors: 1 3 17 51 392417863 1177253589 6671103671 20013311013