Base | Representation |
---|---|
bin | 111101000000001000… |
… | …1101110101101011101 |
3 | 110112010200202221122121 |
4 | 1322000101232231131 |
5 | 4121242243302201 |
6 | 140103041142541 |
7 | 12315221255620 |
oct | 1720021565535 |
9 | 415120687577 |
10 | 131001150301 |
11 | 5061480917a |
12 | 2148002aa51 |
13 | c479425468 |
14 | 64aa435db7 |
15 | 361abc09a1 |
hex | 1e8046eb5d |
131001150301 has 32 divisors (see below), whose sum is σ = 161782645248. Its totient is φ = 103650243840.
The previous prime is 131001150271. The next prime is 131001150317. The reversal of 131001150301 is 103051100131.
It is a cyclic number.
It is not a de Polignac number, because 131001150301 - 27 = 131001150173 is a prime.
It is a super-2 number, since 2×1310011503012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131001150361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 394675 + ... + 646351.
It is an arithmetic number, because the mean of its divisors is an integer number (5055707664).
Almost surely, 2131001150301 is an apocalyptic number.
It is an amenable number.
131001150301 is a deficient number, since it is larger than the sum of its proper divisors (30781494947).
131001150301 is a wasteful number, since it uses less digits than its factorization.
131001150301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251821.
The product of its (nonzero) digits is 45, while the sum is 16.
Adding to 131001150301 its reverse (103051100131), we get a palindrome (234052250432).
The spelling of 131001150301 in words is "one hundred thirty-one billion, one million, one hundred fifty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.287 sec. • engine limits •