Base | Representation |
---|---|
bin | 11100001001111011… |
… | …010011001100011011 |
3 | 2220000212112201121001 |
4 | 130021323103030123 |
5 | 443403203424011 |
6 | 21515453525431 |
7 | 2120105622220 |
oct | 341173231433 |
9 | 86025481531 |
10 | 30231311131 |
11 | 1190387255a |
12 | 5a384a3877 |
13 | 2b0a2930a8 |
14 | 166b05b947 |
15 | bbe0ba7c1 |
hex | 709ed331b |
30231311131 has 8 divisors (see below), whose sum is σ = 35483855840. Its totient is φ = 25212212928.
The previous prime is 30231311129. The next prime is 30231311137. The reversal of 30231311131 is 13111313203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30231311131 - 21 = 30231311129 is a prime.
It is a super-2 number, since 2×302313111312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30231311099 and 30231311108.
It is not an unprimeable number, because it can be changed into a prime (30231311137) 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 7 ways as a sum of consecutive naturals, for example, 58361346 + ... + 58361863.
It is an arithmetic number, because the mean of its divisors is an integer number (4435481980).
Almost surely, 230231311131 is an apocalyptic number.
30231311131 is a deficient number, since it is larger than the sum of its proper divisors (5252544709).
30231311131 is a wasteful number, since it uses less digits than its factorization.
30231311131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116723253.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 30231311131 its reverse (13111313203), we get a palindrome (43342624334).
The spelling of 30231311131 in words is "thirty billion, two hundred thirty-one million, three hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •