Base | Representation |
---|---|
bin | 1101101100000111011100… |
… | …11111101101101000001011 |
3 | 10221120211110000221022202102 |
4 | 12312003232133231220023 |
5 | 12421202203304214011 |
6 | 144005104334024015 |
7 | 6224610450651665 |
oct | 666035637555013 |
9 | 127524400838672 |
10 | 30103132101131 |
11 | 9656737314091 |
12 | 346223204800b |
13 | 13a4936b0616b |
14 | 760ddc39d535 |
15 | 3730b8e9d73b |
hex | 1b60ee7eda0b |
30103132101131 has 4 divisors (see below), whose sum is σ = 30596626070064. Its totient is φ = 29609638132200.
The previous prime is 30103132101127. The next prime is 30103132101149. The reversal of 30103132101131 is 13110123130103.
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 30103132101131 - 22 = 30103132101127 is a prime.
It is a super-2 number, since 2×301031321011312 (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 (30103132101151) 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, 246746984375 + ... + 246746984496.
It is an arithmetic number, because the mean of its divisors is an integer number (7649156517516).
Almost surely, 230103132101131 is an apocalyptic number.
30103132101131 is a deficient number, since it is larger than the sum of its proper divisors (493493968933).
30103132101131 is an equidigital number, since it uses as much as digits as its factorization.
30103132101131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 493493968932.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 30103132101131 its reverse (13110123130103), we get a palindrome (43213255231234).
The spelling of 30103132101131 in words is "thirty trillion, one hundred three billion, one hundred thirty-two million, one hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •