Base | Representation |
---|---|
bin | 10111001100011100011001… |
… | …11011101101000000000101 |
3 | 20200121001002012012110202211 |
4 | 23212032030323231000011 |
5 | 23141131421340213221 |
6 | 300251230414103421 |
7 | 13512665645003662 |
oct | 1346161473550005 |
9 | 220531065173684 |
10 | 51005101101061 |
11 | 15285161964788 |
12 | 58791691aab71 |
13 | 225c9b67880c3 |
14 | c8493530ca69 |
15 | 5d6b5e14d6e1 |
hex | 2e638ceed005 |
51005101101061 has 12 divisors (see below), whose sum is σ = 54025203846252. Its totient is φ = 48146179322304.
The previous prime is 51005101100951. The next prime is 51005101101083. The reversal of 51005101101061 is 16010110150015.
It can be written as a sum of positive squares in 2 ways, for example, as 34279046038561 + 16726055062500 = 5854831^2 + 4089750^2 .
It is not a de Polignac number, because 51005101101061 - 241 = 48806077845509 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51005101101161) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 254933160 + ... + 255133153.
It is an arithmetic number, because the mean of its divisors is an integer number (4502100320521).
Almost surely, 251005101101061 is an apocalyptic number.
It is an amenable number.
51005101101061 is a deficient number, since it is larger than the sum of its proper divisors (3020102745191).
51005101101061 is a wasteful number, since it uses less digits than its factorization.
51005101101061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 510066628 (or 510066609 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 22.
Adding to 51005101101061 its reverse (16010110150015), we get a palindrome (67015211251076).
The spelling of 51005101101061 in words is "fifty-one trillion, five billion, one hundred one million, one hundred one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •