Search a number
-
+
11010201021 = 33407785223
BaseRepresentation
bin10100100000100001…
…00101010110111101
31001102022122011102000
422100100211112331
5140022102413041
65020310452513
7536562110301
oct122020452675
931368564360
1011010201021
11473aa75a96
122173364139
131066089861
147663a7d01
15446906bb6
hex2904255bd

11010201021 has 8 divisors (see below), whose sum is σ = 16311408960. Its totient is φ = 7340133996.

The previous prime is 11010201017. The next prime is 11010201067. The reversal of 11010201021 is 12010201011.

It is a happy number.

It is not a de Polignac number, because 11010201021 - 22 = 11010201017 is a prime.

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

It is a Curzon number.

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

It is a congruent number.

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

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

Almost surely, 211010201021 is an apocalyptic number.

It is an amenable number.

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

11010201021 is an equidigital number, since it uses as much as digits as its factorization.

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

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

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

Adding to 11010201021 its reverse (12010201011), we get a palindrome (23020402032).

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

Divisors: 1 3 9 27 407785223 1223355669 3670067007 11010201021