Base | Representation |
---|---|
bin | 111100101111111111100001… |
… | …1001010111101111100101101 |
3 | 2121002000110202210200011211121 |
4 | 1321133333003022331330231 |
5 | 1030014440104411023031 |
6 | 5132254202201020541 |
7 | 220361232230545612 |
oct | 17137770312757455 |
9 | 2532013683604747 |
10 | 534361630564141 |
11 | 14529a549746816 |
12 | 4bb22a44a84751 |
13 | 19c22115c31ba3 |
14 | 95d535310a509 |
15 | 41b9e8b7ce011 |
hex | 1e5ffc32bdf2d |
534361630564141 has 4 divisors (see below), whose sum is σ = 536393423836512. Its totient is φ = 532329837291772.
The previous prime is 534361630564103. The next prime is 534361630564159. The reversal of 534361630564141 is 141465036163435.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 534361630564141 - 211 = 534361630562093 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 (534361630514141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1015896635791 + ... + 1015896636316.
It is an arithmetic number, because the mean of its divisors is an integer number (134098355959128).
Almost surely, 2534361630564141 is an apocalyptic number.
It is an amenable number.
534361630564141 is a deficient number, since it is larger than the sum of its proper divisors (2031793272371).
534361630564141 is a wasteful number, since it uses less digits than its factorization.
534361630564141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2031793272370.
The product of its (nonzero) digits is 9331200, while the sum is 52.
The spelling of 534361630564141 in words is "five hundred thirty-four trillion, three hundred sixty-one billion, six hundred thirty million, five hundred sixty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •