Base | Representation |
---|---|
bin | 1101101100011001110110… |
… | …10001011001110010110111 |
3 | 10221121202221110012012002022 |
4 | 12312030323101121302313 |
5 | 12421332421043130403 |
6 | 144013420442303355 |
7 | 6225410314553165 |
oct | 666147321316267 |
9 | 127552843165068 |
10 | 30113010130103 |
11 | 965a9461a049a |
12 | 346412a1b7b5b |
13 | 13a584c459514 |
14 | 761698252235 |
15 | 3734962b6d38 |
hex | 1b633b459cb7 |
30113010130103 has 4 divisors (see below), whose sum is σ = 30113141421048. Its totient is φ = 30112878839160.
The previous prime is 30113010130097. The next prime is 30113010130109. The reversal of 30113010130103 is 30103101031103.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (30113010130097) and next prime (30113010130109).
It is a cyclic number.
It is not a de Polignac number, because 30113010130103 - 216 = 30113010064567 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30113010130109) 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, 65300828 + ... + 65760353.
It is an arithmetic number, because the mean of its divisors is an integer number (7528285355262).
Almost surely, 230113010130103 is an apocalyptic number.
30113010130103 is a deficient number, since it is larger than the sum of its proper divisors (131290945).
30113010130103 is a wasteful number, since it uses less digits than its factorization.
30113010130103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131290944.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 30113010130103 its reverse (30103101031103), we get a palindrome (60216111161206).
The spelling of 30113010130103 in words is "thirty trillion, one hundred thirteen billion, ten million, one hundred thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •