Base | Representation |
---|---|
bin | 111100101110010110001110… |
… | …0111000100100110100000111 |
3 | 2121001012212002112200112001010 |
4 | 1321130230130320210310013 |
5 | 1030002234002110102401 |
6 | 5132002243510133303 |
7 | 220336005453230061 |
oct | 17134543470446407 |
9 | 2531185075615033 |
10 | 534135502425351 |
11 | 14521265a265192 |
12 | 4baa7057051233 |
13 | 19c069b9755a78 |
14 | 95c8420cda731 |
15 | 41b41545e3ed6 |
hex | 1e5cb1ce24d07 |
534135502425351 has 32 divisors (see below), whose sum is σ = 740720909716480. Its totient is φ = 342092921788800.
The previous prime is 534135502425319. The next prime is 534135502425353. The reversal of 534135502425351 is 153524205531435.
It is not a de Polignac number, because 534135502425351 - 25 = 534135502425319 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 534135502425351.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (534135502425353) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 186403266 + ... + 189247056.
It is an arithmetic number, because the mean of its divisors is an integer number (23147528428640).
Almost surely, 2534135502425351 is an apocalyptic number.
534135502425351 is a deficient number, since it is larger than the sum of its proper divisors (206585407291129).
534135502425351 is a wasteful number, since it uses less digits than its factorization.
534135502425351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2867767.
The product of its (nonzero) digits is 5400000, while the sum is 48.
Adding to 534135502425351 its reverse (153524205531435), we get a palindrome (687659707956786).
The spelling of 534135502425351 in words is "five hundred thirty-four trillion, one hundred thirty-five billion, five hundred two million, four hundred twenty-five thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •