Search a number
-
+
130220021030 = 25111816540433
BaseRepresentation
bin111100101000110110…
…1111101010100100110
3110110010020221110201212
41321101231331110212
54113142311133110
6135453334551422
712256654626041
oct1712155752446
9413106843655
10130220021030
11502538971a0
12212a2508572
13c38364b9a8
1464347bdc58
1535c2324e05
hex1e51b7d526

130220021030 has 32 divisors (see below), whose sum is σ = 257117541408. Its totient is φ = 47091110400.

The previous prime is 130220021017. The next prime is 130220021033. The reversal of 130220021030 is 30120022031.

It is a happy number.

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

It is a congruent number.

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

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

Almost surely, 2130220021030 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 6540632.

The product of its (nonzero) digits is 72, while the sum is 14.

Adding to 130220021030 its reverse (30120022031), we get a palindrome (160340043061).

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

Divisors: 1 2 5 10 11 22 55 110 181 362 905 1810 1991 3982 9955 19910 6540433 13080866 32702165 65404330 71944763 143889526 359723815 719447630 1183818373 2367636746 5919091865 11838183730 13022002103 26044004206 65110010515 130220021030