Search a number
-
+
10102001020 = 225505100051
BaseRepresentation
bin10010110100010000…
…00100110101111100
3222002000200211012221
421122020010311330
5131142103013040
64350224535124
7505223410006
oct113210046574
928060624187
1010102001020
114314352981
121b5b1814a4
13c4cb819c7
146bb915376
153e1d0a74a
hex25a204d7c

10102001020 has 12 divisors (see below), whose sum is σ = 21214202184. Its totient is φ = 4040800400.

The previous prime is 10102001017. The next prime is 10102001047. The reversal of 10102001020 is 2010020101.

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

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, 252550006 + ... + 252550045.

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

Almost surely, 210102001020 is an apocalyptic number.

10102001020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

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

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

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

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

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

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

Adding to 10102001020 its reverse (2010020101), we get a palindrome (12112021121).

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

Divisors: 1 2 4 5 10 20 505100051 1010200102 2020400204 2525500255 5051000510 10102001020