Base | Representation |
---|---|
bin | 1001101000100010011… |
… | …01000110110101000111 |
3 | 1011122101001000121201122 |
4 | 10310101031012311013 |
5 | 20410342242132221 |
6 | 412020530544155 |
7 | 32625342120425 |
oct | 4642115066507 |
9 | 1148331017648 |
10 | 331001130311 |
11 | 118416566355 |
12 | 5419773805b |
13 | 252a07384b7 |
14 | 12040510115 |
15 | 892413deab |
hex | 4d11346d47 |
331001130311 has 4 divisors (see below), whose sum is σ = 331659184752. Its totient is φ = 330343075872.
The previous prime is 331001130281. The next prime is 331001130319. The reversal of 331001130311 is 113031100133.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113031100133 = 7 ⋅16147300019.
It is a cyclic number.
It is not a de Polignac number, because 331001130311 - 218 = 331000868167 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 331001130311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331001130319) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 329026466 + ... + 329027471.
It is an arithmetic number, because the mean of its divisors is an integer number (82914796188).
Almost surely, 2331001130311 is an apocalyptic number.
331001130311 is a deficient number, since it is larger than the sum of its proper divisors (658054441).
331001130311 is an equidigital number, since it uses as much as digits as its factorization.
331001130311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 658054440.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 331001130311 its reverse (113031100133), we get a palindrome (444032230444).
The spelling of 331001130311 in words is "three hundred thirty-one billion, one million, one hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •