Base | Representation |
---|---|
bin | 100111100001100001010… |
… | …1010010111111101000101 |
3 | 201020022012201001121221022 |
4 | 1033003002222113331011 |
5 | 1202444422231101323 |
6 | 15315250244400525 |
7 | 1100312420556665 |
oct | 117030252277505 |
9 | 21208181047838 |
10 | 5432104550213 |
11 | 1804819449690 |
12 | 7389409a6145 |
13 | 305325ab9683 |
14 | 14acb56a61a5 |
15 | 9647c8a94c8 |
hex | 4f0c2a97f45 |
5432104550213 has 4 divisors (see below), whose sum is σ = 5925932236608. Its totient is φ = 4938276863820.
The previous prime is 5432104550137. The next prime is 5432104550233. The reversal of 5432104550213 is 3120554012345.
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 a de Polignac number, because none of the positive numbers 2k-5432104550213 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5432104550233) 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, 246913843181 + ... + 246913843202.
It is an arithmetic number, because the mean of its divisors is an integer number (1481483059152).
Almost surely, 25432104550213 is an apocalyptic number.
It is an amenable number.
5432104550213 is a deficient number, since it is larger than the sum of its proper divisors (493827686395).
5432104550213 is a wasteful number, since it uses less digits than its factorization.
5432104550213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 493827686394.
The product of its (nonzero) digits is 72000, while the sum is 35.
Adding to 5432104550213 its reverse (3120554012345), we get a palindrome (8552658562558).
The spelling of 5432104550213 in words is "five trillion, four hundred thirty-two billion, one hundred four million, five hundred fifty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •