Search a number
-
+
131010000000 = 2735711397
BaseRepresentation
bin111101000000011001…
…1011111010010000000
3110112011022102120011020
41322000303133102000
54121302030000000
6140103554545440
712315356424525
oct1720063372200
9415138376136
10131010000000
1150619803080
1221482b98280
13c47b203579
1464ab69b14c
15361b86cba0
hex1e80cdf480

131010000000 has 512 divisors, whose sum is σ = 475733157120. Its totient is φ = 31680000000.

The previous prime is 131009999993. The next prime is 131010000019. The reversal of 131010000000 is 10131.

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is an unprimeable number.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 329999802 + ... + 330000198.

Almost surely, 2131010000000 is an apocalyptic number.

131010000000 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 131010000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (237866578560).

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

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

131010000000 is an frugal number, since it uses more digits than its factorization.

131010000000 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 3, while the sum is 6.

Adding to 131010000000 its reverse (10131), we get a palindrome (131010010131).

The spelling of 131010000000 in words is "one hundred thirty-one billion, ten million", and thus it is an aban number.