Base | Representation |
---|---|
bin | 100110111001100011000… |
… | …0000100110101011110011 |
3 | 200221002122010221220120112 |
4 | 1031303012000212223303 |
5 | 1200043120402112233 |
6 | 15212012155131535 |
7 | 1061153224534310 |
oct | 115630600465363 |
9 | 20832563856515 |
10 | 5346261363443 |
11 | 1781378187930 |
12 | 724184143bab |
13 | 2ca1c5231bc0 |
14 | 146a9089bd07 |
15 | 9410642b048 |
hex | 4dcc6026af3 |
5346261363443 has 32 divisors (see below), whose sum is σ = 7185590963712. Its totient is φ = 3841501708800.
The previous prime is 5346261363403. The next prime is 5346261363467. The reversal of 5346261363443 is 3443631626435.
It is not a de Polignac number, because 5346261363443 - 212 = 5346261359347 is a prime.
It is a Smith number, since the sum of its digits (50) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 5346261363391 and 5346261363400.
It is not an unprimeable number, because it can be changed into a prime (5346261363403) 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, 1778246 + ... + 3722187.
It is an arithmetic number, because the mean of its divisors is an integer number (224549717616).
Almost surely, 25346261363443 is an apocalyptic number.
5346261363443 is a deficient number, since it is larger than the sum of its proper divisors (1839329600269).
5346261363443 is a wasteful number, since it uses less digits than its factorization.
5346261363443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5501435.
The product of its digits is 11197440, while the sum is 50.
Adding to 5346261363443 its reverse (3443631626435), we get a palindrome (8789892989878).
The spelling of 5346261363443 in words is "five trillion, three hundred forty-six billion, two hundred sixty-one million, three hundred sixty-three thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •