Base | Representation |
---|---|
bin | 10111001111100001110101… |
… | …11111101110001010000101 |
3 | 20200222011200110222012022101 |
4 | 23213300322333232022011 |
5 | 23144401013223330221 |
6 | 300412040535232101 |
7 | 13523440501633540 |
oct | 1347607277561205 |
9 | 220864613865271 |
10 | 51111100605061 |
11 | 15316106911a52 |
12 | 5895810218631 |
13 | 22699aa21b8c3 |
14 | c89b0d08d857 |
15 | 5d97b4e23d91 |
hex | 2e7c3afee285 |
51111100605061 has 16 divisors (see below), whose sum is σ = 58436258652160. Its totient is φ = 43791836986800.
The previous prime is 51111100605023. The next prime is 51111100605107. The reversal of 51111100605061 is 16050600111115.
It is not a de Polignac number, because 51111100605061 - 27 = 51111100604933 is a prime.
It is a super-2 number, since 2×511111006050612 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51111100605661) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 665306110 + ... + 665382928.
It is an arithmetic number, because the mean of its divisors is an integer number (3652266165760).
Almost surely, 251111100605061 is an apocalyptic number.
It is an amenable number.
51111100605061 is a deficient number, since it is larger than the sum of its proper divisors (7325158047099).
51111100605061 is a wasteful number, since it uses less digits than its factorization.
51111100605061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113944.
The product of its (nonzero) digits is 900, while the sum is 28.
Adding to 51111100605061 its reverse (16050600111115), we get a palindrome (67161700716176).
The spelling of 51111100605061 in words is "fifty-one trillion, one hundred eleven billion, one hundred million, six hundred five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •