Base | Representation |
---|---|
bin | 111101000110111101… |
… | …1000110101010100011 |
3 | 110112201122120210202221 |
4 | 1322031323012222203 |
5 | 4122224401201011 |
6 | 140141500251511 |
7 | 12324001306054 |
oct | 1721573065243 |
9 | 415648523687 |
10 | 131230100131 |
11 | 50721a74609 |
12 | 21524840b97 |
13 | c4b49a7730 |
14 | 64cc9d272b |
15 | 3630d47971 |
hex | 1e8dec6aa3 |
131230100131 has 8 divisors (see below), whose sum is σ = 145144310864. Its totient is φ = 117861544800.
The previous prime is 131230100077. The next prime is 131230100149. The reversal of 131230100131 is 131001032131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131230100131 - 213 = 131230091939 is a prime.
It is a super-2 number, since 2×1312301001312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131230100431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 136413345 + ... + 136414306.
It is an arithmetic number, because the mean of its divisors is an integer number (18143038858).
Almost surely, 2131230100131 is an apocalyptic number.
131230100131 is a deficient number, since it is larger than the sum of its proper divisors (13914210733).
131230100131 is a wasteful number, since it uses less digits than its factorization.
131230100131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272827701.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 131230100131 its reverse (131001032131), we get a palindrome (262231132262).
It can be divided in two parts, 131230 and 100131, that added together give a square (231361 = 4812).
The spelling of 131230100131 in words is "one hundred thirty-one billion, two hundred thirty million, one hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •