Base | Representation |
---|---|
bin | 1011101101010001101… |
… | …0001001110101010111 |
3 | 201020011020120102010210 |
4 | 2323110122021311113 |
5 | 11243404310341211 |
6 | 232222051220503 |
7 | 20350145552403 |
oct | 2732432116527 |
9 | 636136512123 |
10 | 201132121431 |
11 | 7833292584a |
12 | 32b928a7733 |
13 | 15c74a38607 |
14 | 9a405c2103 |
15 | 5372a529a6 |
hex | 2ed4689d57 |
201132121431 has 4 divisors (see below), whose sum is σ = 268176161912. Its totient is φ = 134088080952.
The previous prime is 201132121427. The next prime is 201132121499. The reversal of 201132121431 is 134121231102.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 201132121431 - 22 = 201132121427 is a prime.
It is a super-2 number, since 2×2011321214312 (a number of 23 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 = 201132121398 and 201132121407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201132111431) 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, 33522020236 + ... + 33522020241.
It is an arithmetic number, because the mean of its divisors is an integer number (67044040478).
Almost surely, 2201132121431 is an apocalyptic number.
201132121431 is a deficient number, since it is larger than the sum of its proper divisors (67044040481).
201132121431 is an equidigital number, since it uses as much as digits as its factorization.
201132121431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67044040480.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 201132121431 its reverse (134121231102), we get a palindrome (335253352533).
The spelling of 201132121431 in words is "two hundred one billion, one hundred thirty-two million, one hundred twenty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •