Search a number
-
+
201010200021 = 3317437930719
BaseRepresentation
bin1011101100110100100…
…1000011110111010101
3201012211202011011102000
42323031021003313111
511243132102400041
6232202014105513
720344135336401
oct2731511036725
9635752134360
10201010200021
1178280021454
1232b59aab299
1315c556bac77
149a2c326101
155366ebcbb6
hex2ecd243dd5

201010200021 has 16 divisors (see below), whose sum is σ = 315310118400. Its totient is φ = 126124046784.

The previous prime is 201010199983. The next prime is 201010200029. The reversal of 201010200021 is 120002010102.

It is not a de Polignac number, because 201010200021 - 226 = 200943091157 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (201010200029) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 218964901 + ... + 218965818.

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

Almost surely, 2201010200021 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 437930745 (or 437930739 counting only the distinct ones).

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

Adding to 201010200021 its reverse (120002010102), we get a palindrome (321012210123).

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

Divisors: 1 3 9 17 27 51 153 459 437930719 1313792157 3941376471 7444822223 11824129413 22334466669 67003400007 201010200021