Base | Representation |
---|---|
bin | 10010111011110001… |
… | …010011001101100001 |
3 | 1221110211201201122202 |
4 | 102323301103031201 |
5 | 313114003213241 |
6 | 13201201142545 |
7 | 1316541162542 |
oct | 227361231541 |
9 | 57424651582 |
10 | 20330132321 |
11 | 8692914354 |
12 | 3b3462aa55 |
13 | 1bbcbc59c5 |
14 | dac0a04c9 |
15 | 7dec2cd9b |
hex | 4bbc53361 |
20330132321 has 4 divisors (see below), whose sum is σ = 20539721412. Its totient is φ = 20120543232.
The previous prime is 20330132287. The next prime is 20330132323. The reversal of 20330132321 is 12323103302.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2923024225 + 17407108096 = 54065^2 + 131936^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20330132321 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20330132293 and 20330132302.
It is not an unprimeable number, because it can be changed into a prime (20330132323) 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, 104794400 + ... + 104794593.
It is an arithmetic number, because the mean of its divisors is an integer number (5134930353).
Almost surely, 220330132321 is an apocalyptic number.
It is an amenable number.
20330132321 is a deficient number, since it is larger than the sum of its proper divisors (209589091).
20330132321 is an equidigital number, since it uses as much as digits as its factorization.
20330132321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 209589090.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 20330132321 its reverse (12323103302), we get a palindrome (32653235623).
The spelling of 20330132321 in words is "twenty billion, three hundred thirty million, one hundred thirty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •