Base | Representation |
---|---|
bin | 111101000000001100… |
… | …0110010010011000000 |
3 | 110112010211020220221222 |
4 | 1322000120302103000 |
5 | 4121243232000000 |
6 | 140103144534212 |
7 | 12315243061415 |
oct | 1720030622300 |
9 | 415124226858 |
10 | 131003000000 |
11 | 50615861954 |
12 | 21480781368 |
13 | c479922362 |
14 | 64aa79810c |
15 | 361ae38a85 |
hex | 1e806324c0 |
131003000000 has 196 divisors, whose sum is σ = 326822379120. Its totient is φ = 52099200000.
The previous prime is 131002999997. The next prime is 131003000039. The reversal of 131003000000 is 300131.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 268999757 + ... + 269000243.
Almost surely, 2131003000000 is an apocalyptic number.
131003000000 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 131003000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (163411189560).
131003000000 is an abundant number, since it is smaller than the sum of its proper divisors (195819379120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131003000000 is an frugal number, since it uses more digits than its factorization.
131003000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 798 (or 763 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 8.
Adding to 131003000000 its reverse (300131), we get a palindrome (131003300131).
The spelling of 131003000000 in words is "one hundred thirty-one billion, three million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •