Base | Representation |
---|---|
bin | 10010100011001… |
… | …000111000110011 |
3 | 210200120122222020 |
4 | 102203020320303 |
5 | 1114131420311 |
6 | 50514042523 |
7 | 10466111340 |
oct | 2243107063 |
9 | 720518866 |
10 | 311201331 |
11 | 14a735191 |
12 | 88279443 |
13 | 4c6203cc |
14 | 2d48b7c7 |
15 | 1c4c2c06 |
hex | 128c8e33 |
311201331 has 8 divisors (see below), whose sum is σ = 474211584. Its totient is φ = 177829320.
The previous prime is 311201311. The next prime is 311201347. The reversal of 311201331 is 133102113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 311201331 - 25 = 311201299 is a prime.
It is a super-2 number, since 2×3112013312 = 193692536832343122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 311201331.
It is not an unprimeable number, because it can be changed into a prime (311201311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7409535 + ... + 7409576.
It is an arithmetic number, because the mean of its divisors is an integer number (59276448).
Almost surely, 2311201331 is an apocalyptic number.
311201331 is a deficient number, since it is larger than the sum of its proper divisors (163010253).
311201331 is a wasteful number, since it uses less digits than its factorization.
311201331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14819121.
The product of its (nonzero) digits is 54, while the sum is 15.
The square root of 311201331 is about 17640.8993818342. The cubic root of 311201331 is about 677.6630642840.
Adding to 311201331 its reverse (133102113), we get a palindrome (444303444).
The spelling of 311201331 in words is "three hundred eleven million, two hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •