Base | Representation |
---|---|
bin | 1000101110110111101… |
… | …01101000110010010101 |
3 | 1001200110101002202221202 |
4 | 10113123311220302111 |
5 | 14403440444430141 |
6 | 345500440122245 |
7 | 30451203354041 |
oct | 4273365506225 |
9 | 1050411082852 |
10 | 300041014421 |
11 | 106279370015 |
12 | 4a197166385 |
13 | 223a848c0b5 |
14 | 1074477b021 |
15 | 7c110b149b |
hex | 45dbd68c95 |
300041014421 has 8 divisors (see below), whose sum is σ = 300467543040. Its totient is φ = 299614586512.
The previous prime is 300041014393. The next prime is 300041014439. The reversal of 300041014421 is 124410140003.
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 300041014421 - 238 = 25163107477 is a prime.
It is a super-2 number, since 2×3000410144212 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 300041014393 and 300041014402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (300041013421) 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, 7511420 + ... + 7551258.
It is an arithmetic number, because the mean of its divisors is an integer number (37558442880).
Almost surely, 2300041014421 is an apocalyptic number.
It is an amenable number.
300041014421 is a deficient number, since it is larger than the sum of its proper divisors (426528619).
300041014421 is an equidigital number, since it uses as much as digits as its factorization.
300041014421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50355.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 300041014421 its reverse (124410140003), we get a palindrome (424451154424).
The spelling of 300041014421 in words is "three hundred billion, forty-one million, fourteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •