Base | Representation |
---|---|
bin | 1001000011100001111… |
… | …11000000110111100101 |
3 | 1002202002102000210200020 |
4 | 10201300333000313211 |
5 | 20044200100242013 |
6 | 354533240305353 |
7 | 31323112444632 |
oct | 4416077006745 |
9 | 1082072023606 |
10 | 311133212133 |
11 | 10aa50650367 |
12 | 50371a72259 |
13 | 23455527ab3 |
14 | 110b79ab189 |
15 | 815ecb3623 |
hex | 4870fc0de5 |
311133212133 has 4 divisors (see below), whose sum is σ = 414844282848. Its totient is φ = 207422141420.
The previous prime is 311133212129. The next prime is 311133212227. The reversal of 311133212133 is 331212331113.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 311133212133 - 22 = 311133212129 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (311133212633) 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 3 ways as a sum of consecutive naturals, for example, 51855535353 + ... + 51855535358.
It is an arithmetic number, because the mean of its divisors is an integer number (103711070712).
Almost surely, 2311133212133 is an apocalyptic number.
It is an amenable number.
311133212133 is a deficient number, since it is larger than the sum of its proper divisors (103711070715).
311133212133 is a wasteful number, since it uses less digits than its factorization.
311133212133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103711070714.
The product of its digits is 972, while the sum is 24.
Adding to 311133212133 its reverse (331212331113), we get a palindrome (642345543246).
The spelling of 311133212133 in words is "three hundred eleven billion, one hundred thirty-three million, two hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •