Base | Representation |
---|---|
bin | 11000011100011110110000… |
… | …00010111000111100010001 |
3 | 21001022221102011012201111202 |
4 | 30032033120002320330101 |
5 | 24021211011412024432 |
6 | 310154434235120545 |
7 | 14215452326621654 |
oct | 1416173002707421 |
9 | 231287364181452 |
10 | 53755140345617 |
11 | 16145477371227 |
12 | 60421338a3155 |
13 | 23cc11b3b9b49 |
14 | d3ba96acb89b |
15 | 63346422b462 |
hex | 30e3d80b8f11 |
53755140345617 has 4 divisors (see below), whose sum is σ = 53755316123376. Its totient is φ = 53754964567860.
The previous prime is 53755140345593. The next prime is 53755140345619. The reversal of 53755140345617 is 71654304155735.
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-53755140345617 is a prime.
It is a super-2 number, since 2×537551403456172 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53755140345619) 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, 87429359 + ... + 88042052.
It is an arithmetic number, because the mean of its divisors is an integer number (13438829030844).
Almost surely, 253755140345617 is an apocalyptic number.
It is an amenable number.
53755140345617 is a deficient number, since it is larger than the sum of its proper divisors (175777759).
53755140345617 is a wasteful number, since it uses less digits than its factorization.
53755140345617 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175777758.
The product of its (nonzero) digits is 26460000, while the sum is 56.
The spelling of 53755140345617 in words is "fifty-three trillion, seven hundred fifty-five billion, one hundred forty million, three hundred forty-five thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •