Base | Representation |
---|---|
bin | 10111001111100001110000… |
… | …10101110000101100111001 |
3 | 20200222011120101010121122000 |
4 | 23213300320111300230321 |
5 | 23144400420322113001 |
6 | 300412032304251213 |
7 | 13523436421140402 |
oct | 1347607025605471 |
9 | 220864511117560 |
10 | 51111056051001 |
11 | 15316093750911 |
12 | 58957b9310b09 |
13 | 22699a0c1c25b |
14 | c89b071b29a9 |
15 | 5d97b1072a86 |
hex | 2e7c38570b39 |
51111056051001 has 16 divisors (see below), whose sum is σ = 75723579592320. Its totient is φ = 34072463918160.
The previous prime is 51111056050993. The next prime is 51111056051023. The reversal of 51111056051001 is 10015065011115.
51111056051001 is a `hidden beast` number, since 51 + 1 + 1 + 1 + 0 + 5 + 605 + 1 + 0 + 0 + 1 = 666.
It is not a de Polignac number, because 51111056051001 - 23 = 51111056050993 is a prime.
It is a super-2 number, since 2×511110560510012 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (51111056001001) 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, 43111245 + ... + 44280938.
It is an arithmetic number, because the mean of its divisors is an integer number (4732723724520).
Almost surely, 251111056051001 is an apocalyptic number.
It is an amenable number.
51111056051001 is a deficient number, since it is larger than the sum of its proper divisors (24612523541319).
51111056051001 is a wasteful number, since it uses less digits than its factorization.
51111056051001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87413853 (or 87413847 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 27.
The spelling of 51111056051001 in words is "fifty-one trillion, one hundred eleven billion, fifty-six million, fifty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •