Base | Representation |
---|---|
bin | 111101000000110010… |
… | …1010111011110011110 |
3 | 110112012020000212000000 |
4 | 1322001211113132132 |
5 | 4121313401401410 |
6 | 140105143115130 |
7 | 12315605522655 |
oct | 1720145273636 |
9 | 415166025000 |
10 | 131023075230 |
11 | 50626123753 |
12 | 21487442aa6 |
13 | c480b30aa8 |
14 | 64ad30219c |
15 | 361caa1dc0 |
hex | 1e8195779e |
131023075230 has 56 divisors (see below), whose sum is σ = 353600565912. Its totient is φ = 34939484784.
The previous prime is 131023075219. The next prime is 131023075237. The reversal of 131023075230 is 32570320131.
131023075230 is a `hidden beast` number, since 1 + 3 + 102 + 30 + 7 + 523 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 131023075194 and 131023075203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131023075237) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 8979204 + ... + 8993783.
Almost surely, 2131023075230 is an apocalyptic number.
131023075230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131023075230 is an abundant number, since it is smaller than the sum of its proper divisors (222577490682).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131023075230 is an equidigital number, since it uses as much as digits as its factorization.
131023075230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17973012 (or 17972997 counting only the distinct ones).
The product of its (nonzero) digits is 3780, while the sum is 27.
Adding to 131023075230 its reverse (32570320131), we get a palindrome (163593395361).
The spelling of 131023075230 in words is "one hundred thirty-one billion, twenty-three million, seventy-five thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •