Base | Representation |
---|---|
bin | 110010010000000001… |
… | …010100010000110001 |
3 | 12011021021111021112222 |
4 | 302100001110100301 |
5 | 1341000200344133 |
6 | 40441553330425 |
7 | 3620035225445 |
oct | 622001242061 |
9 | 164237437488 |
10 | 53955871793 |
11 | 2097875708a |
12 | a559866a15 |
13 | 511b4b0875 |
14 | 287bc78825 |
15 | 160bceee98 |
hex | c90054431 |
53955871793 has 4 divisors (see below), whose sum is σ = 55271868708. Its totient is φ = 52639874880.
The previous prime is 53955871789. The next prime is 53955871799. The reversal of 53955871793 is 39717855935.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 14118905329 + 39836966464 = 118823^2 + 199592^2 .
It is a cyclic number.
It is not a de Polignac number, because 53955871793 - 22 = 53955871789 is a prime.
It is a super-2 number, since 2×539558717932 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53955871799) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 657998396 + ... + 657998477.
It is an arithmetic number, because the mean of its divisors is an integer number (13817967177).
Almost surely, 253955871793 is an apocalyptic number.
It is an amenable number.
53955871793 is a deficient number, since it is larger than the sum of its proper divisors (1315996915).
53955871793 is a wasteful number, since it uses less digits than its factorization.
53955871793 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1315996914.
The product of its digits is 35721000, while the sum is 62.
The spelling of 53955871793 in words is "fifty-three billion, nine hundred fifty-five million, eight hundred seventy-one thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •