Base | Representation |
---|---|
bin | 110010010000001010… |
… | …010000011010110001 |
3 | 12011021102220100022012 |
4 | 302100022100122301 |
5 | 1341001300342340 |
6 | 40442115452305 |
7 | 3620064156116 |
oct | 622012203261 |
9 | 164242810265 |
10 | 53958215345 |
11 | 2097a007901 |
12 | a55a5b7095 |
13 | 511bb21498 |
14 | 287c2c890d |
15 | 160c114565 |
hex | c902906b1 |
53958215345 has 8 divisors (see below), whose sum is σ = 66127515264. Its totient is φ = 42248134384.
The previous prime is 53958215341. The next prime is 53958215369. The reversal of 53958215345 is 54351285935.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 53958215345 - 22 = 53958215341 is a prime.
It is a super-2 number, since 2×539582153452 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 53958215293 and 53958215302.
It is not an unprimeable number, because it can be changed into a prime (53958215341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 114804479 + ... + 114804948.
It is an arithmetic number, because the mean of its divisors is an integer number (8265939408).
Almost surely, 253958215345 is an apocalyptic number.
It is an amenable number.
53958215345 is a deficient number, since it is larger than the sum of its proper divisors (12169299919).
53958215345 is a wasteful number, since it uses less digits than its factorization.
53958215345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229609479.
The product of its digits is 3240000, while the sum is 50.
The spelling of 53958215345 in words is "fifty-three billion, nine hundred fifty-eight million, two hundred fifteen thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •