Search a number
-
+
130630009797600 = 253524311103114493
BaseRepresentation
bin11101101100111010101011…
…010101001011101111100000
3122010112002212222121000102020
4131230322223111023233200
5114110220230002010400
61141454333102221440
736341464263502665
oct3554725325135740
9563462788530366
10130630009797600
1138693970016945
1212798b79b84880
1357b7484628181
142438751cbba6c
151017ebdd282a0
hex76ceab54bbe0

130630009797600 has 288 divisors, whose sum is σ = 426577341302784. Its totient is φ = 34722034636800.

The previous prime is 130630009797559. The next prime is 130630009797619. The reversal of 130630009797600 is 6797900036031.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1140885954 + ... + 1141000446.

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

Almost surely, 2130630009797600 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 130630009797600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (213288670651392).

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

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

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

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

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

The product of its (nonzero) digits is 1285956, while the sum is 51.

The spelling of 130630009797600 in words is "one hundred thirty trillion, six hundred thirty billion, nine million, seven hundred ninety-seven thousand, six hundred".