Base | Representation |
---|---|
bin | 1110100110010001011001… |
… | …00000010010000010110011 |
3 | 11012122212011001000021010201 |
4 | 13103020230200102002303 |
5 | 13201422012022332243 |
6 | 152135052021340031 |
7 | 6522146636551216 |
oct | 723105440220263 |
9 | 135585131007121 |
10 | 32101332230323 |
11 | a25710a189334 |
12 | 3725553267617 |
13 | 14bb1b14c4205 |
14 | 7cd9d9bab77d |
15 | 3aa068e4b04d |
hex | 1d322c8120b3 |
32101332230323 has 4 divisors (see below), whose sum is σ = 32269402032768. Its totient is φ = 31933262427880.
The previous prime is 32101332230311. The next prime is 32101332230339. The reversal of 32101332230323 is 32303223310123.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32101332230323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32101332230291 and 32101332230300.
It is not an unprimeable number, because it can be changed into a prime (32101332230423) 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, 84034900936 + ... + 84034901317.
It is an arithmetic number, because the mean of its divisors is an integer number (8067350508192).
Almost surely, 232101332230323 is an apocalyptic number.
32101332230323 is a deficient number, since it is larger than the sum of its proper divisors (168069802445).
32101332230323 is a wasteful number, since it uses less digits than its factorization.
32101332230323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168069802444.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 32101332230323 its reverse (32303223310123), we get a palindrome (64404555540446).
The spelling of 32101332230323 in words is "thirty-two trillion, one hundred one billion, three hundred thirty-two million, two hundred thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •