Base | Representation |
---|---|
bin | 11101111011001110… |
… | …101001110111010011 |
3 | 10001221100102101210201 |
4 | 131323032221313103 |
5 | 1011301321211011 |
6 | 22432240440031 |
7 | 2215160164630 |
oct | 357316516723 |
9 | 101840371721 |
10 | 32132210131 |
11 | 1269988206a |
12 | 6289019017 |
13 | 305104cbb8 |
14 | 17ab6bb187 |
15 | c80e04cc1 |
hex | 77b3a9dd3 |
32132210131 has 8 divisors (see below), whose sum is σ = 36728482400. Its totient is φ = 27537427008.
The previous prime is 32132210113. The next prime is 32132210147. The reversal of 32132210131 is 13101223123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 32132210131 - 27 = 32132210003 is a prime.
It is a super-2 number, since 2×321322101312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32132210099 and 32132210108.
It is not an unprimeable number, because it can be changed into a prime (32132210161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 325656 + ... + 412693.
It is an arithmetic number, because the mean of its divisors is an integer number (4591060300).
Almost surely, 232132210131 is an apocalyptic number.
32132210131 is a deficient number, since it is larger than the sum of its proper divisors (4596272269).
32132210131 is an equidigital number, since it uses as much as digits as its factorization.
32132210131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 744573.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 32132210131 its reverse (13101223123), we get a palindrome (45233433254).
The spelling of 32132210131 in words is "thirty-two billion, one hundred thirty-two million, two hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •