Base | Representation |
---|---|
bin | 100010000110111110000101… |
… | …1111010110010111000010101 |
3 | 1110100022010022220002110110211 |
4 | 1010031330023322302320111 |
5 | 303311102441422033323 |
6 | 2542033351410445421 |
7 | 120124046445526351 |
oct | 10415741372627025 |
9 | 1410263286073424 |
10 | 300025140424213 |
11 | 87662a47148316 |
12 | 29796a70593871 |
13 | cb54331a66789 |
14 | 54134196d4461 |
15 | 24a4520a1d70d |
hex | 110df0beb2e15 |
300025140424213 has 8 divisors (see below), whose sum is σ = 302137953062400. Its totient is φ = 297913984249200.
The previous prime is 300025140424159. The next prime is 300025140424241. The reversal of 300025140424213 is 312424041520003.
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 300025140424213 - 217 = 300025140293141 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 (300025140424283) 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, 413752270 + ... + 414476767.
It is an arithmetic number, because the mean of its divisors is an integer number (37767244132800).
Almost surely, 2300025140424213 is an apocalyptic number.
It is an amenable number.
300025140424213 is a deficient number, since it is larger than the sum of its proper divisors (2112812638187).
300025140424213 is a wasteful number, since it uses less digits than its factorization.
300025140424213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 828231587.
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 300025140424213 its reverse (312424041520003), we get a palindrome (612449181944216).
The spelling of 300025140424213 in words is "three hundred trillion, twenty-five billion, one hundred forty million, four hundred twenty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •