Base | Representation |
---|---|
bin | 111100010000010111001100… |
… | …1100011010111001000110111 |
3 | 2120111121212212121020021020202 |
4 | 1320200232121203113020313 |
5 | 1023432224020401142101 |
6 | 5115125133215351115 |
7 | 216432164360464241 |
oct | 17040563143271067 |
9 | 2514555777207222 |
10 | 530014425412151 |
11 | 143973945774549 |
12 | 4b54041a82249b |
13 | 199981b85b0074 |
14 | 94c4b995bb091 |
15 | 4141d58d3d36b |
hex | 1e20b998d7237 |
530014425412151 has 16 divisors (see below), whose sum is σ = 538697104595808. Its totient is φ = 521354728540800.
The previous prime is 530014425412127. The next prime is 530014425412183. The reversal of 530014425412151 is 151214524410035.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-530014425412151 is a prime.
It is a super-2 number, since 2×5300144254121512 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530014425412751) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 253144781 + ... + 255229913.
It is an arithmetic number, because the mean of its divisors is an integer number (33668569037238).
Almost surely, 2530014425412151 is an apocalyptic number.
530014425412151 is a deficient number, since it is larger than the sum of its proper divisors (8682679183657).
530014425412151 is a wasteful number, since it uses less digits than its factorization.
530014425412151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2090642.
The product of its (nonzero) digits is 96000, while the sum is 38.
Adding to 530014425412151 its reverse (151214524410035), we get a palindrome (681228949822186).
The spelling of 530014425412151 in words is "five hundred thirty trillion, fourteen billion, four hundred twenty-five million, four hundred twelve thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •