Base | Representation |
---|---|
bin | 1110100110010001110000… |
… | …11011001110111011100001 |
3 | 11012122212122222100110211121 |
4 | 13103020320123032323201 |
5 | 13201422414222432231 |
6 | 152135123524212241 |
7 | 6522154615550536 |
oct | 723107033167341 |
9 | 135585588313747 |
10 | 32101532233441 |
11 | a257202073670 |
12 | 37255aa23a081 |
13 | 14bb213a7ca58 |
14 | 7cda18590d8d |
15 | 3aa07b7a6311 |
hex | 1d32386ceee1 |
32101532233441 has 8 divisors (see below), whose sum is σ = 35068023716544. Its totient is φ = 29143069145520.
The previous prime is 32101532233427. The next prime is 32101532233447. The reversal of 32101532233441 is 14433223510123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 32101532233441 - 219 = 32101531709153 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32101532233397 and 32101532233406.
It is not an unprimeable number, because it can be changed into a prime (32101532233447) 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, 2007090430 + ... + 2007106423.
It is an arithmetic number, because the mean of its divisors is an integer number (4383502964568).
Almost surely, 232101532233441 is an apocalyptic number.
It is an amenable number.
32101532233441 is a deficient number, since it is larger than the sum of its proper divisors (2966491483103).
32101532233441 is a wasteful number, since it uses less digits than its factorization.
32101532233441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4014197591.
The product of its (nonzero) digits is 51840, while the sum is 34.
Adding to 32101532233441 its reverse (14433223510123), we get a palindrome (46534755743564).
The spelling of 32101532233441 in words is "thirty-two trillion, one hundred one billion, five hundred thirty-two million, two hundred thirty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •