Base | Representation |
---|---|
bin | 11101111011000111… |
… | …000110111111101101 |
3 | 10001221012200220201202 |
4 | 131323013012333231 |
5 | 1011300314413201 |
6 | 22432130215245 |
7 | 2215134316436 |
oct | 357307067755 |
9 | 101835626652 |
10 | 32130232301 |
11 | 126987510a2 |
12 | 6288424525 |
13 | 305080989b |
14 | 17ab32448d |
15 | c80b63c6b |
hex | 77b1c6fed |
32130232301 has 4 divisors (see below), whose sum is σ = 32133682812. Its totient is φ = 32126781792.
The previous prime is 32130232297. The next prime is 32130232349. The reversal of 32130232301 is 10323203123.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10323203123 = 52579 ⋅196337.
It can be written as a sum of positive squares in 2 ways, for example, as 15527652100 + 16602580201 = 124610^2 + 128851^2 .
It is a cyclic number.
It is not a de Polignac number, because 32130232301 - 22 = 32130232297 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32130232391) 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, 1711250 + ... + 1729923.
It is an arithmetic number, because the mean of its divisors is an integer number (8033420703).
Almost surely, 232130232301 is an apocalyptic number.
It is an amenable number.
32130232301 is a deficient number, since it is larger than the sum of its proper divisors (3450511).
32130232301 is an equidigital number, since it uses as much as digits as its factorization.
32130232301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3450510.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 32130232301 its reverse (10323203123), we get a palindrome (42453435424).
The spelling of 32130232301 in words is "thirty-two billion, one hundred thirty million, two hundred thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •