Base | Representation |
---|---|
bin | 110001011100000101… |
… | …010110001010101011 |
3 | 12002000112212122220211 |
4 | 301130011112022223 |
5 | 1332204113403224 |
6 | 40215305201551 |
7 | 3556324625563 |
oct | 613405261253 |
9 | 162015778824 |
10 | 53084512939 |
11 | 205709072a7 |
12 | a355a902b7 |
13 | 500cb04803 |
14 | 27d8255da3 |
15 | 15aa57e894 |
hex | c5c1562ab |
53084512939 has 4 divisors (see below), whose sum is σ = 53084989000. Its totient is φ = 53084036880.
The previous prime is 53084512931. The next prime is 53084512973. The reversal of 53084512939 is 93921548035.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 53084512939 - 23 = 53084512931 is a prime.
It is a super-3 number, since 3×530845129393 (a number of 33 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53084512892 and 53084512901.
It is not an unprimeable number, because it can be changed into a prime (53084512931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29344 + ... + 327154.
It is an arithmetic number, because the mean of its divisors is an integer number (13271247250).
Almost surely, 253084512939 is an apocalyptic number.
53084512939 is a deficient number, since it is larger than the sum of its proper divisors (476061).
53084512939 is a wasteful number, since it uses less digits than its factorization.
53084512939 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 476060.
The product of its (nonzero) digits is 1166400, while the sum is 49.
The spelling of 53084512939 in words is "fifty-three billion, eighty-four million, five hundred twelve thousand, nine hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •