Base | Representation |
---|---|
bin | 1101110010001010101010… |
… | …00000001110100111101001 |
3 | 10222022201000102111120002110 |
4 | 12321011111000032213221 |
5 | 12433103422121043423 |
6 | 144244404053552533 |
7 | 6245620043523351 |
oct | 671052500164751 |
9 | 128281012446073 |
10 | 30311010331113 |
11 | 9726911142056 |
12 | 3496588045749 |
13 | 13bb415371985 |
14 | 76b0bc8cbb61 |
15 | 3786d3db8193 |
hex | 1b915500e9e9 |
30311010331113 has 8 divisors (see below), whose sum is σ = 41808290112000. Its totient is φ = 19510535385488.
The previous prime is 30311010331109. The next prime is 30311010331139. The reversal of 30311010331113 is 31113301011303.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30311010331113 - 22 = 30311010331109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30311010331113.
It is not an unprimeable number, because it can be changed into a prime (30311010331153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 174201208713 + ... + 174201208886.
It is an arithmetic number, because the mean of its divisors is an integer number (5226036264000).
Almost surely, 230311010331113 is an apocalyptic number.
It is an amenable number.
30311010331113 is a deficient number, since it is larger than the sum of its proper divisors (11497279780887).
30311010331113 is a wasteful number, since it uses less digits than its factorization.
30311010331113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 348402417631.
The product of its (nonzero) digits is 243, while the sum is 21.
Adding to 30311010331113 its reverse (31113301011303), we get a palindrome (61424311342416).
The spelling of 30311010331113 in words is "thirty trillion, three hundred eleven billion, ten million, three hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •