Base | Representation |
---|---|
bin | 1110110100110110000011… |
… | …11101010100000000001001 |
3 | 11021102201121022211202202121 |
4 | 13122123001331110000021 |
5 | 13233123002244231131 |
6 | 153201102214331241 |
7 | 6603264223244104 |
oct | 732330175240011 |
9 | 137381538752677 |
10 | 32602055852041 |
11 | a42a4aa65a505 |
12 | 37a65b6659b21 |
13 | 152648c532100 |
14 | 809d3b15773b |
15 | 3b80c336a911 |
hex | 1da6c1f54009 |
32602055852041 has 9 divisors (see below), whose sum is σ = 35302898252181. Its totient is φ = 30094136884032.
The previous prime is 32602055852033. The next prime is 32602055852053. The reversal of 32602055852041 is 14025855020623.
The square root of 32602055852041 is 5709821.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 14802263611641 + 17799792240400 = 3847371^2 + 4218980^2 .
It is not a de Polignac number, because 32602055852041 - 23 = 32602055852033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (32602055852141) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 74008065 + ... + 74447281.
Almost surely, 232602055852041 is an apocalyptic number.
32602055852041 is the 5709821-st square number.
32602055852041 is the 2854911-st centered octagonal number.
It is an amenable number.
32602055852041 is a deficient number, since it is larger than the sum of its proper divisors (2700842400140).
32602055852041 is an frugal number, since it uses more digits than its factorization.
32602055852041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 878460 (or 439230 counting only the distinct ones).
The product of its (nonzero) digits is 576000, while the sum is 43.
The spelling of 32602055852041 in words is "thirty-two trillion, six hundred two billion, fifty-five million, eight hundred fifty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •