Search a number
-
+
20001111310 = 252000111131
BaseRepresentation
bin10010101000001010…
…001011110100001110
31220121220121201200101
4102220022023310032
5311430241030220
613104405121314
71305434432605
oct225012136416
956556551611
1020001111310
118534118a64
123a623b923a
131b699a670b
14d7a4d4a3c
157c0dda30a
hex4a828bd0e

20001111310 has 8 divisors (see below), whose sum is σ = 36002000376. Its totient is φ = 8000444520.

The previous prime is 20001111307. The next prime is 20001111343. The reversal of 20001111310 is 1311110002.

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

It is a super-2 number, since 2×200011113102 (a number of 21 digits) contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 2000111131 = 20001111310 / (2 + 0 + 0 + 0 + 1 + 1 + 1 + 1 + 3 + 1 + 0).

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1000055556 + ... + 1000055575.

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

Almost surely, 220001111310 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2000111138.

The product of its (nonzero) digits is 6, while the sum is 10.

Adding to 20001111310 its reverse (1311110002), we get a palindrome (21312221312).

The spelling of 20001111310 in words is "twenty billion, one million, one hundred eleven thousand, three hundred ten".

Divisors: 1 2 5 10 2000111131 4000222262 10000555655 20001111310