Base | Representation |
---|---|
bin | 1001000011111001100… |
… | …01101000010011010111 |
3 | 1002202121012021000002110 |
4 | 10201330301220103113 |
5 | 20100101220431411 |
6 | 355005024242103 |
7 | 31331034044034 |
oct | 4417461502327 |
9 | 1082535230073 |
10 | 311331030231 |
11 | 110042282aa1 |
12 | 50408170333 |
13 | 234874c9c20 |
14 | 110d5d8238b |
15 | 817233b2a6 |
hex | 487cc684d7 |
311331030231 has 64 divisors (see below), whose sum is σ = 467971080192. Its totient is φ = 182836628352.
The previous prime is 311331030191. The next prime is 311331030239. The reversal of 311331030231 is 132030133113.
It is a de Polignac number, because none of the positive numbers 2k-311331030231 is a prime.
It is a super-2 number, since 2×3113310302312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 311331030198 and 311331030207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (311331030239) 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 63 ways as a sum of consecutive naturals, for example, 50677546 + ... + 50683688.
It is an arithmetic number, because the mean of its divisors is an integer number (7312048128).
Almost surely, 2311331030231 is an apocalyptic number.
311331030231 is a deficient number, since it is larger than the sum of its proper divisors (156640049961).
311331030231 is a wasteful number, since it uses less digits than its factorization.
311331030231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6892.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 311331030231 its reverse (132030133113), we get a palindrome (443361163344).
The spelling of 311331030231 in words is "three hundred eleven billion, three hundred thirty-one million, thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •