Search a number
-
+
20001201121 = 116911263101
BaseRepresentation
bin10010101000001010…
…100001101111100001
31220121220210021212201
4102220022201233201
5311430301413441
613104411053201
71305435255466
oct225012415741
956556707781
1020001201121
11853417a490
123a62441201
131b69a08565
14d7a51966d
157c0e06c31
hex4a82a1be1

20001201121 has 8 divisors (see below), whose sum is σ = 21822732288. Its totient is φ = 18180210000.

The previous prime is 20001201089. The next prime is 20001201127. The reversal of 20001201121 is 12110210002.

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 20001201121 - 25 = 20001201089 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 220001201121 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 270023.

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

Adding to 20001201121 its reverse (12110210002), we get a palindrome (32111411123).

It can be divided in two parts, 20001 and 201121, that added together give a palindrome (221122).

The spelling of 20001201121 in words is "twenty billion, one million, two hundred one thousand, one hundred twenty-one".

Divisors: 1 11 6911 76021 263101 2894111 1818291011 20001201121