Base | Representation |
---|---|
bin | 11101110111011001100110… |
… | …110101110100100101110110 |
3 | 122020001222101021111211221201 |
4 | 131313121212311310211312 |
5 | 114204021122244400400 |
6 | 1143205314151003114 |
7 | 36444516510606010 |
oct | 3567314665644566 |
9 | 566058337454851 |
10 | 131350415231350 |
11 | 38941442110977 |
12 | 1289471036949a |
13 | 583a3a2464663 |
14 | 24615732851b0 |
15 | 102bad453506a |
hex | 777666d74976 |
131350415231350 has 192 divisors, whose sum is σ = 292155798153600. Its totient is φ = 42982821826560.
The previous prime is 131350415231303. The next prime is 131350415231383. The reversal of 131350415231350 is 53132514053131.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 4477891284 + ... + 4477920616.
It is an arithmetic number, because the mean of its divisors is an integer number (1521644782050).
Almost surely, 2131350415231350 is an apocalyptic number.
131350415231350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131350415231350 is an abundant number, since it is smaller than the sum of its proper divisors (160805382922250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131350415231350 is a wasteful number, since it uses less digits than its factorization.
131350415231350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34427 (or 34422 counting only the distinct ones).
The product of its (nonzero) digits is 81000, while the sum is 37.
Adding to 131350415231350 its reverse (53132514053131), we get a palindrome (184482929284481).
The spelling of 131350415231350 in words is "one hundred thirty-one trillion, three hundred fifty billion, four hundred fifteen million, two hundred thirty-one thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •