Base | Representation |
---|---|
bin | 1101110010001010101010… |
… | …00110111111001111011011 |
3 | 10222022201000112211120211202 |
4 | 12321011111012333033123 |
5 | 12433103423044300011 |
6 | 144244404155544415 |
7 | 6245620064553524 |
oct | 671052506771733 |
9 | 128281015746752 |
10 | 30311012103131 |
11 | 9726912142431 |
12 | 349658875b10b |
13 | 13bb4158423c6 |
14 | 76b0bcc2d84b |
15 | 3786d411823b |
hex | 1b91551bf3db |
30311012103131 has 4 divisors (see below), whose sum is σ = 30379434252792. Its totient is φ = 30242589953472.
The previous prime is 30311012103083. The next prime is 30311012103181. The reversal of 30311012103131 is 13130121011303.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30311012103131 - 222 = 30311007908827 is a prime.
It is a super-2 number, since 2×303110121031312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30311012103181) 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, 34211074166 + ... + 34211075051.
It is an arithmetic number, because the mean of its divisors is an integer number (7594858563198).
Almost surely, 230311012103131 is an apocalyptic number.
30311012103131 is a deficient number, since it is larger than the sum of its proper divisors (68422149661).
30311012103131 is an equidigital number, since it uses as much as digits as its factorization.
30311012103131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68422149660.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 30311012103131 its reverse (13130121011303), we get a palindrome (43441133114434).
The spelling of 30311012103131 in words is "thirty trillion, three hundred eleven billion, twelve million, one hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •