Base | Representation |
---|---|
bin | 110000011011000010… |
… | …010101000000101001 |
3 | 11222012111101100202011 |
4 | 300123002111000221 |
5 | 1322440224441404 |
6 | 35515122435521 |
7 | 3520303634266 |
oct | 603302250051 |
9 | 158174340664 |
10 | 51993202729 |
11 | 20060897836 |
12 | a0b0502ba1 |
13 | 4b979a7220 |
14 | 273333a26d |
15 | 1544863604 |
hex | c1b095029 |
51993202729 has 4 divisors (see below), whose sum is σ = 55992679876. Its totient is φ = 47993725584.
The previous prime is 51993202727. The next prime is 51993202741. The reversal of 51993202729 is 92720239915.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 92720239915 = 5 ⋅18544047983.
It can be written as a sum of positive squares in 2 ways, for example, as 5673554329 + 46319648400 = 75323^2 + 215220^2 .
It is a cyclic number.
It is not a de Polignac number, because 51993202729 - 21 = 51993202727 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51993202727) 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 3 ways as a sum of consecutive naturals, for example, 1999738554 + ... + 1999738579.
It is an arithmetic number, because the mean of its divisors is an integer number (13998169969).
Almost surely, 251993202729 is an apocalyptic number.
It is an amenable number.
51993202729 is a deficient number, since it is larger than the sum of its proper divisors (3999477147).
51993202729 is a wasteful number, since it uses less digits than its factorization.
51993202729 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3999477146.
The product of its (nonzero) digits is 612360, while the sum is 49.
The spelling of 51993202729 in words is "fifty-one billion, nine hundred ninety-three million, two hundred two thousand, seven hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •