Base | Representation |
---|---|
bin | 10111010110100010100111… |
… | …00001110001010000110001 |
3 | 20201211012120021210110221010 |
4 | 23223101103201301100301 |
5 | 23212322424232234213 |
6 | 301114444100021133 |
7 | 13550030116664226 |
oct | 1353212341612061 |
9 | 221735507713833 |
10 | 51352030352433 |
11 | 153a9301431148 |
12 | 591444b0917a9 |
13 | 22866251009b5 |
14 | c97646ddd94d |
15 | 5e0bb67d5ac3 |
hex | 2eb453871431 |
51352030352433 has 8 divisors (see below), whose sum is σ = 70678063280896. Its totient is φ = 33130342162800.
The previous prime is 51352030352401. The next prime is 51352030352437. The reversal of 51352030352433 is 33425303025315.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51352030352433 - 25 = 51352030352401 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51352030352391 and 51352030352400.
It is not an unprimeable number, because it can be changed into a prime (51352030352437) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 276086184598 + ... + 276086184783.
It is an arithmetic number, because the mean of its divisors is an integer number (8834757910112).
Almost surely, 251352030352433 is an apocalyptic number.
It is an amenable number.
51352030352433 is a deficient number, since it is larger than the sum of its proper divisors (19326032928463).
51352030352433 is a wasteful number, since it uses less digits than its factorization.
51352030352433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 552172369415.
The product of its (nonzero) digits is 486000, while the sum is 39.
Adding to 51352030352433 its reverse (33425303025315), we get a palindrome (84777333377748).
The spelling of 51352030352433 in words is "fifty-one trillion, three hundred fifty-two billion, thirty million, three hundred fifty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •