Base | Representation |
---|---|
bin | 10010111011001111… |
… | …010110010100000100 |
3 | 1221110012222112220010 |
4 | 102323033112110010 |
5 | 313104213412012 |
6 | 13200242310220 |
7 | 1316402423505 |
oct | 227317262404 |
9 | 57405875803 |
10 | 20321232132 |
11 | 8688895523 |
12 | 3b31658370 |
13 | 1bbb0ca916 |
14 | daac24bac |
15 | 7de070c3c |
hex | 4bb3d6504 |
20321232132 has 48 divisors (see below), whose sum is σ = 50259908160. Its totient is φ = 6368366592.
The previous prime is 20321232121. The next prime is 20321232137. The reversal of 20321232132 is 23123212302.
It is a happy number.
It is a super-3 number, since 3×203212321323 (a number of 32 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20321232099 and 20321232108.
It is not an unprimeable number, because it can be changed into a prime (20321232137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 135903 + ... + 243129.
It is an arithmetic number, because the mean of its divisors is an integer number (1047081420).
Almost surely, 220321232132 is an apocalyptic number.
It is an amenable number.
20321232132 is an abundant number, since it is smaller than the sum of its proper divisors (29938676028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20321232132 is a wasteful number, since it uses less digits than its factorization.
20321232132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108180 (or 108178 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 20321232132 its reverse (23123212302), we get a palindrome (43444444434).
The spelling of 20321232132 in words is "twenty billion, three hundred twenty-one million, two hundred thirty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •