Base | Representation |
---|---|
bin | 11101111111011001… |
… | …011011000110110011 |
3 | 10002010020000022110210 |
4 | 131333121123012303 |
5 | 1011422222022011 |
6 | 22443215355203 |
7 | 2216666456205 |
oct | 357731330663 |
9 | 102106008423 |
10 | 32202142131 |
11 | 127252a7005 |
12 | 62a8522b03 |
13 | 3062696793 |
14 | 17b6ac2775 |
15 | c8711a6a6 |
hex | 77f65b1b3 |
32202142131 has 4 divisors (see below), whose sum is σ = 42936189512. Its totient is φ = 21468094752.
The previous prime is 32202142099. The next prime is 32202142249. The reversal of 32202142131 is 13124120223.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 32202142131 - 25 = 32202142099 is a prime.
It is a super-2 number, since 2×322021421312 (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 = 32202142098 and 32202142107.
It is not an unprimeable number, because it can be changed into a prime (32202141131) 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 3 ways as a sum of consecutive naturals, for example, 5367023686 + ... + 5367023691.
It is an arithmetic number, because the mean of its divisors is an integer number (10734047378).
Almost surely, 232202142131 is an apocalyptic number.
32202142131 is a deficient number, since it is larger than the sum of its proper divisors (10734047381).
32202142131 is a wasteful number, since it uses less digits than its factorization.
32202142131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10734047380.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 32202142131 its reverse (13124120223), we get a palindrome (45326262354).
The spelling of 32202142131 in words is "thirty-two billion, two hundred two million, one hundred forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •