Base | Representation |
---|---|
bin | 110001111011011100… |
… | …000001010101001111 |
3 | 12010101012201010221102 |
4 | 301323130001111033 |
5 | 1334243300104412 |
6 | 40343420053315 |
7 | 3605343106235 |
oct | 617334012517 |
9 | 163335633842 |
10 | 53610550607 |
11 | 20810838179 |
12 | a48209423b |
13 | 5094aa51c3 |
14 | 2848068955 |
15 | 15db83c8c2 |
hex | c7b70154f |
53610550607 has 4 divisors (see below), whose sum is σ = 53611032600. Its totient is φ = 53610068616.
The previous prime is 53610550603. The next prime is 53610550639. The reversal of 53610550607 is 70605501635.
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 53610550607 - 22 = 53610550603 is a prime.
It is a super-2 number, since 2×536105506072 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53610550603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20228 + ... + 328070.
It is an arithmetic number, because the mean of its divisors is an integer number (13402758150).
Almost surely, 253610550607 is an apocalyptic number.
53610550607 is a deficient number, since it is larger than the sum of its proper divisors (481993).
53610550607 is a wasteful number, since it uses less digits than its factorization.
53610550607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 481992.
The product of its (nonzero) digits is 94500, while the sum is 38.
The spelling of 53610550607 in words is "fifty-three billion, six hundred ten million, five hundred fifty thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •