Base | Representation |
---|---|
bin | 100010110011010001001010… |
… | …0100010010110111001000001 |
3 | 1111010212011012020202200212012 |
4 | 1011212202110202112321001 |
5 | 310110330221143431022 |
6 | 3003014315523342305 |
7 | 121322651306060012 |
oct | 10546422442267101 |
9 | 1433764166680765 |
10 | 306113401155137 |
11 | 8959aa676571a4 |
12 | 2a3ba9b2821995 |
13 | 101a64a67a0334 |
14 | 5583d793d7009 |
15 | 255caa32c3de2 |
hex | 1166894896e41 |
306113401155137 has 8 divisors (see below), whose sum is σ = 311303603486400. Its totient is φ = 300923260143984.
The previous prime is 306113401155053. The next prime is 306113401155151. The reversal of 306113401155137 is 731551104311603.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-306113401155137 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 306113401155094 and 306113401155103.
It is not an unprimeable number, because it can be changed into a prime (306113401145137) 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, 5205062 + ... + 25284767.
It is an arithmetic number, because the mean of its divisors is an integer number (38912950435800).
Almost surely, 2306113401155137 is an apocalyptic number.
It is an amenable number.
306113401155137 is a deficient number, since it is larger than the sum of its proper divisors (5190202331263).
306113401155137 is a wasteful number, since it uses less digits than its factorization.
306113401155137 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30660055.
The product of its (nonzero) digits is 113400, while the sum is 41.
The spelling of 306113401155137 in words is "three hundred six trillion, one hundred thirteen billion, four hundred one million, one hundred fifty-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •