Search a number
-
+
10001201022 = 232555622279
BaseRepresentation
bin10010101000001111…
…00011011101111110
3221211000000122121200
421110013203131332
5130440301413042
64332224240330
7502560543321
oct112407433576
927730018550
1010001201022
11427246539a
121b314700a6
13c3501b037
146ac3967b8
153d8048c4c
hex2541e377e

10001201022 has 12 divisors (see below), whose sum is σ = 21669268920. Its totient is φ = 3333733668.

The previous prime is 10001201011. The next prime is 10001201123. The reversal of 10001201022 is 22010210001.

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 = 10001200995 and 10001201013.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 277811122 + ... + 277811157.

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

Almost surely, 210001201022 is an apocalyptic number.

10001201022 is an abundant number, since it is smaller than the sum of its proper divisors (11668067898).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

Adding to 10001201022 its reverse (22010210001), we get a palindrome (32011411023).

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

Divisors: 1 2 3 6 9 18 555622279 1111244558 1666866837 3333733674 5000600511 10001201022