Base | Representation |
---|---|
bin | 111101001111110000… |
… | …0100011100001011011 |
3 | 110120111012201220010101 |
4 | 1322133200203201123 |
5 | 4123330413132311 |
6 | 140231040000231 |
7 | 12334213106320 |
oct | 1723740434133 |
9 | 416435656111 |
10 | 131525130331 |
11 | 50863564121 |
12 | 215a7600077 |
13 | c530b5540a |
14 | 6519c70b47 |
15 | 364bbc3ec1 |
hex | 1e9f82385b |
131525130331 has 4 divisors (see below), whose sum is σ = 150314434672. Its totient is φ = 112735825992.
The previous prime is 131525130311. The next prime is 131525130397. The reversal of 131525130331 is 133031525131.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 131525130331 - 25 = 131525130299 is a prime.
It is a super-2 number, since 2×1315251303312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131525130331.
It is not an unprimeable number, because it can be changed into a prime (131525130311) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9394652160 + ... + 9394652173.
It is an arithmetic number, because the mean of its divisors is an integer number (37578608668).
Almost surely, 2131525130331 is an apocalyptic number.
131525130331 is a deficient number, since it is larger than the sum of its proper divisors (18789304341).
131525130331 is an equidigital number, since it uses as much as digits as its factorization.
131525130331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18789304340.
The product of its (nonzero) digits is 4050, while the sum is 28.
Adding to 131525130331 its reverse (133031525131), we get a palindrome (264556655462).
The spelling of 131525130331 in words is "one hundred thirty-one billion, five hundred twenty-five million, one hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •