Base | Representation |
---|---|
bin | 10010111010101100… |
… | …101000111000001101 |
3 | 1221102120212021102011 |
4 | 102322230220320031 |
5 | 313044401230013 |
6 | 13155315301221 |
7 | 1316232166015 |
oct | 227254507015 |
9 | 57376767364 |
10 | 20312133133 |
11 | 8683740296 |
12 | 3b2a5aa811 |
13 | 1bb92631b6 |
14 | da9936c45 |
15 | 7dd374c3d |
hex | 4bab28e0d |
20312133133 has 8 divisors (see below), whose sum is σ = 20375611256. Its totient is φ = 20248704000.
The previous prime is 20312133097. The next prime is 20312133139. The reversal of 20312133133 is 33133121302.
It can be written as a sum of positive squares in 4 ways, for example, as 1388829289 + 18923303844 = 37267^2 + 137562^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20312133133 - 225 = 20278578701 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20312133139) 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 7 ways as a sum of consecutive naturals, for example, 929533 + ... + 951133.
It is an arithmetic number, because the mean of its divisors is an integer number (2546951407).
Almost surely, 220312133133 is an apocalyptic number.
It is an amenable number.
20312133133 is a deficient number, since it is larger than the sum of its proper divisors (63478123).
20312133133 is a wasteful number, since it uses less digits than its factorization.
20312133133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24495.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 20312133133 its reverse (33133121302), we get a palindrome (53445254435).
The spelling of 20312133133 in words is "twenty billion, three hundred twelve million, one hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •