Base | Representation |
---|---|
bin | 1101110001111000000011… |
… | …01010001100110101011001 |
3 | 10222021202020022220111211110 |
4 | 12320330001222030311121 |
5 | 12432422443130104423 |
6 | 144240033011450533 |
7 | 6245114401212303 |
oct | 670740152146531 |
9 | 128252208814743 |
10 | 30301022113113 |
11 | 9722656045034 |
12 | 349465abb6a49 |
13 | 13ba4b2c4b1cb |
14 | 76a812154973 |
15 | 3782ec086193 |
hex | 1b8f01a8cd59 |
30301022113113 has 8 divisors (see below), whose sum is σ = 40401436814176. Its totient is φ = 20200644410400.
The previous prime is 30301022113079. The next prime is 30301022113139. The reversal of 30301022113113 is 31131122010303.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30301022113113 - 28 = 30301022112857 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30301022113113.
It is not an unprimeable number, because it can be changed into a prime (30301022113183) 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, 7278628 + ... + 10657413.
It is an arithmetic number, because the mean of its divisors is an integer number (5050179601772).
Almost surely, 230301022113113 is an apocalyptic number.
It is an amenable number.
30301022113113 is a deficient number, since it is larger than the sum of its proper divisors (10100414701063).
30301022113113 is a wasteful number, since it uses less digits than its factorization.
30301022113113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18499175.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 30301022113113 its reverse (31131122010303), we get a palindrome (61432144123416).
The spelling of 30301022113113 in words is "thirty trillion, three hundred one billion, twenty-two million, one hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •