Base | Representation |
---|---|
bin | 10111001101110001001011… |
… | …00010011001101111110001 |
3 | 20200202101112212012200221200 |
4 | 23212320211202121233301 |
5 | 23142403122412234401 |
6 | 300324154342241413 |
7 | 13516166506146123 |
oct | 1346704542315761 |
9 | 220671485180850 |
10 | 51050611055601 |
11 | 152a2496066163 |
12 | 5885b4a426269 |
13 | 226408a2282a1 |
14 | c86c115a5213 |
15 | 5d7e2471e686 |
hex | 2e6e25899bf1 |
51050611055601 has 18 divisors (see below), whose sum is σ = 76370203338390. Its totient is φ = 32860163433216.
The previous prime is 51050611055597. The next prime is 51050611055693. The reversal of 51050611055601 is 10655011605015.
It is a happy number.
51050611055601 is a `hidden beast` number, since 51 + 0 + 50 + 6 + 1 + 1 + 0 + 556 + 0 + 1 = 666.
It can be written as a sum of positive squares in 3 ways, for example, as 8501603894001 + 42549007161600 = 2915751^2 + 6522960^2 .
It is not a de Polignac number, because 51050611055601 - 22 = 51050611055597 is a prime.
It is not an unprimeable number, because it can be changed into a prime (51050611075601) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 3372340896 + ... + 3372356033.
It is an arithmetic number, because the mean of its divisors is an integer number (4242789074355).
Almost surely, 251050611055601 is an apocalyptic number.
It is an amenable number.
51050611055601 is a deficient number, since it is larger than the sum of its proper divisors (25319592282789).
51050611055601 is a wasteful number, since it uses less digits than its factorization.
51050611055601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6744696993 (or 6744696961 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 36.
The spelling of 51050611055601 in words is "fifty-one trillion, fifty billion, six hundred eleven million, fifty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •