Base | Representation |
---|---|
bin | 1011110101011001101… |
… | …0000011011001001100 |
3 | 201102210020112021201221 |
4 | 2331112122003121030 |
5 | 11312341130230012 |
6 | 233222322013124 |
7 | 20455201055164 |
oct | 2752632033114 |
9 | 642706467657 |
10 | 203313133132 |
11 | 79251a6615a |
12 | 334a11a71a4 |
13 | 1623184c195 |
14 | 9baa1195a4 |
15 | 544e26d507 |
hex | 2f5668364c |
203313133132 has 12 divisors (see below), whose sum is σ = 355807620000. Its totient is φ = 101653813136.
The previous prime is 203313133099. The next prime is 203313133151. The reversal of 203313133132 is 231331313302.
203313133132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2033131331322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 203313133097 and 203313133106.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 517507 + ... + 821242.
It is an arithmetic number, because the mean of its divisors is an integer number (29650635000).
Almost surely, 2203313133132 is an apocalyptic number.
It is an amenable number.
203313133132 is a deficient number, since it is larger than the sum of its proper divisors (152494486868).
203313133132 is a wasteful number, since it uses less digits than its factorization.
203313133132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1376720 (or 1376718 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 203313133132 its reverse (231331313302), we get a palindrome (434644446434).
The spelling of 203313133132 in words is "two hundred three billion, three hundred thirteen million, one hundred thirty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •