Base | Representation |
---|---|
bin | 1111101000011… |
… | …01010111001010 |
3 | 100010201221001120 |
4 | 13310031113022 |
5 | 232032023410 |
6 | 21002300110 |
7 | 3151362450 |
oct | 764152712 |
9 | 303657046 |
10 | 131126730 |
11 | 680214a9 |
12 | 37ab7636 |
13 | 212215a7 |
14 | 135b49d0 |
15 | b7a2570 |
hex | 7d0d5ca |
131126730 has 64 divisors (see below), whose sum is σ = 361912320. Its totient is φ = 29784384.
The previous prime is 131126713. The next prime is 131126767. The reversal of 131126730 is 37621131.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 131126730.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 33201 + ... + 36939.
It is an arithmetic number, because the mean of its divisors is an integer number (5654880).
Almost surely, 2131126730 is an apocalyptic number.
131126730 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 131126730, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (180956160).
131126730 is an abundant number, since it is smaller than the sum of its proper divisors (230785590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131126730 is a wasteful number, since it uses less digits than its factorization.
131126730 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3923.
The product of its (nonzero) digits is 756, while the sum is 24.
The square root of 131126730 is about 11451.0580297193. The cubic root of 131126730 is about 508.0390286628.
Adding to 131126730 its reverse (37621131), we get a palindrome (168747861).
The spelling of 131126730 in words is "one hundred thirty-one million, one hundred twenty-six thousand, seven hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •