Base | Representation |
---|---|
bin | 1110100110111101101111… |
… | …10000101100100001000001 |
3 | 11012202010121110221010211210 |
4 | 13103132313300230201001 |
5 | 13202314243202340221 |
6 | 152154030453400333 |
7 | 6523652000305356 |
oct | 723366760544101 |
9 | 135663543833753 |
10 | 32125143402561 |
11 | a266218a4a480 |
12 | 372a0996390a9 |
13 | 14c0507648541 |
14 | 7d0c182d262d |
15 | 3aa9ae58d276 |
hex | 1d37b7c2c841 |
32125143402561 has 8 divisors (see below), whose sum is σ = 46727481312864. Its totient is φ = 19469783880320.
The previous prime is 32125143402529. The next prime is 32125143402619. The reversal of 32125143402561 is 16520434152123.
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 32125143402561 - 25 = 32125143402529 is a prime.
It is not an unprimeable number, because it can be changed into a prime (32125143404561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 486744596976 + ... + 486744597041.
It is an arithmetic number, because the mean of its divisors is an integer number (5840935164108).
Almost surely, 232125143402561 is an apocalyptic number.
It is an amenable number.
32125143402561 is a deficient number, since it is larger than the sum of its proper divisors (14602337910303).
32125143402561 is a wasteful number, since it uses less digits than its factorization.
32125143402561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 973489194031.
The product of its (nonzero) digits is 172800, while the sum is 39.
Adding to 32125143402561 its reverse (16520434152123), we get a palindrome (48645577554684).
The spelling of 32125143402561 in words is "thirty-two trillion, one hundred twenty-five billion, one hundred forty-three million, four hundred two thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •