Base | Representation |
---|---|
bin | 1011010010101100… |
… | …0111011000110011 |
3 | 21211020201222111222 |
4 | 2310223013120303 |
5 | 22201441420311 |
6 | 1220441055255 |
7 | 135054533444 |
oct | 26453073063 |
9 | 7736658458 |
10 | 3031201331 |
11 | 1316041474 |
12 | 70718752b |
13 | 393cba272 |
14 | 20a8092cb |
15 | 12b1a8adb |
hex | b4ac7633 |
3031201331 has 4 divisors (see below), whose sum is σ = 3051275664. Its totient is φ = 3011127000.
The previous prime is 3031201319. The next prime is 3031201339. The reversal of 3031201331 is 1331021303.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3031201331 is a prime.
It is a super-2 number, since 2×30312013312 = 18376363018112343122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3031201339) 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 3 ways as a sum of consecutive naturals, for example, 10036940 + ... + 10037241.
It is an arithmetic number, because the mean of its divisors is an integer number (762818916).
Almost surely, 23031201331 is an apocalyptic number.
3031201331 is a deficient number, since it is larger than the sum of its proper divisors (20074333).
3031201331 is a wasteful number, since it uses less digits than its factorization.
3031201331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20074332.
The product of its (nonzero) digits is 162, while the sum is 17.
The square root of 3031201331 is about 55056.3468729991. The cubic root of 3031201331 is about 1447.2323474645.
Adding to 3031201331 its reverse (1331021303), we get a palindrome (4362222634).
The spelling of 3031201331 in words is "three billion, thirty-one million, two hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •