Base | Representation |
---|---|
bin | 11101000011110011… |
… | …110101100001001101 |
3 | 2222112112212211111102 |
4 | 131003303311201031 |
5 | 1002400310324401 |
6 | 22200104232445 |
7 | 2153140206500 |
oct | 350363654115 |
9 | 88475784442 |
10 | 31202433101 |
11 | 12261a618a4 |
12 | 606976b725 |
13 | 2c3352bb88 |
14 | 172000d137 |
15 | c2949556b |
hex | 743cf584d |
31202433101 has 12 divisors (see below), whose sum is σ = 37548320220. Its totient is φ = 25822702080.
The previous prime is 31202433071. The next prime is 31202433113. The reversal of 31202433101 is 10133420213.
It can be written as a sum of positive squares in 2 ways, for example, as 26260202500 + 4942230601 = 162050^2 + 70301^2 .
It is a de Polignac number, because none of the positive numbers 2k-31202433101 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31202453101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10977620 + ... + 10980461.
It is an arithmetic number, because the mean of its divisors is an integer number (3129026685).
Almost surely, 231202433101 is an apocalyptic number.
It is an amenable number.
31202433101 is a deficient number, since it is larger than the sum of its proper divisors (6345887119).
31202433101 is a wasteful number, since it uses less digits than its factorization.
31202433101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21958124 (or 21958117 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 31202433101 its reverse (10133420213), we get a palindrome (41335853314).
The spelling of 31202433101 in words is "thirty-one billion, two hundred two million, four hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •