Base | Representation |
---|---|
bin | 101111100101110111… |
… | …001000011111101110 |
3 | 11212220022200121011122 |
4 | 233211313020133232 |
5 | 1314123333403223 |
6 | 35250413220542 |
7 | 3456221655140 |
oct | 574567103756 |
9 | 155808617148 |
10 | 51101075438 |
11 | 1a743252356 |
12 | 9aa1791752 |
13 | 4a84c0905a |
14 | 268aa6cc90 |
15 | 14e138e5c8 |
hex | be5dc87ee |
51101075438 has 32 divisors (see below), whose sum is σ = 93655471104. Its totient is φ = 20412070272.
The previous prime is 51101075419. The next prime is 51101075461. The reversal of 51101075438 is 83457010115.
It is a super-2 number, since 2×511010754382 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 51101075398 and 51101075407.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1017770 + ... + 1066797.
It is an arithmetic number, because the mean of its divisors is an integer number (2926733472).
Almost surely, 251101075438 is an apocalyptic number.
51101075438 is a deficient number, since it is larger than the sum of its proper divisors (42554395666).
51101075438 is a wasteful number, since it uses less digits than its factorization.
51101075438 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2084696.
The product of its (nonzero) digits is 16800, while the sum is 35.
The spelling of 51101075438 in words is "fifty-one billion, one hundred one million, seventy-five thousand, four hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •