Base | Representation |
---|---|
bin | 1110100110111101111001… |
… | …11101000110010101100011 |
3 | 11012202010211112220012010012 |
4 | 13103132330331012111203 |
5 | 13202314433004241011 |
6 | 152154043245155135 |
7 | 6523654106046641 |
oct | 723367475062543 |
9 | 135663745805105 |
10 | 32125230540131 |
11 | a2662631561a3 |
12 | 372a10285baab |
13 | 14c051c707631 |
14 | 7d0c25ad6191 |
15 | 3aa9b7051a8b |
hex | 1d37bcf46563 |
32125230540131 has 8 divisors (see below), whose sum is σ = 32178930146064. Its totient is φ = 32071575044320.
The previous prime is 32125230540127. The next prime is 32125230540157. The reversal of 32125230540131 is 13104503252123.
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 32125230540131 - 22 = 32125230540127 is a prime.
It is a super-2 number, since 2×321252305401312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (32125230540031) 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, 9569561 + ... + 12483066.
It is an arithmetic number, because the mean of its divisors is an integer number (4022366268258).
Almost surely, 232125230540131 is an apocalyptic number.
32125230540131 is a deficient number, since it is larger than the sum of its proper divisors (53699605933).
32125230540131 is a wasteful number, since it uses less digits than its factorization.
32125230540131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22055061.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 32125230540131 its reverse (13104503252123), we get a palindrome (45229733792254).
The spelling of 32125230540131 in words is "thirty-two trillion, one hundred twenty-five billion, two hundred thirty million, five hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •