Base | Representation |
---|---|
bin | 101111100110011101… |
… | …000011001010001011 |
3 | 11212221000101120202110 |
4 | 233212131003022023 |
5 | 1314133404440201 |
6 | 35251410233403 |
7 | 3456402313455 |
oct | 574635031213 |
9 | 155830346673 |
10 | 51111015051 |
11 | 1a748921108 |
12 | 9aa4b85863 |
13 | 4a86ca9295 |
14 | 268c0d92d5 |
15 | 14e21a46d6 |
hex | be674328b |
51111015051 has 16 divisors (see below), whose sum is σ = 71982310400. Its totient is φ = 32207988960.
The previous prime is 51111015023. The next prime is 51111015061. The reversal of 51111015051 is 15051011115.
It is not a de Polignac number, because 51111015051 - 25 = 51111015019 is a prime.
It is a super-2 number, since 2×511110150512 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51111015061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6386476 + ... + 6394473.
It is an arithmetic number, because the mean of its divisors is an integer number (4498894400).
Almost surely, 251111015051 is an apocalyptic number.
51111015051 is a deficient number, since it is larger than the sum of its proper divisors (20871295349).
51111015051 is a wasteful number, since it uses less digits than its factorization.
51111015051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12781026.
The product of its (nonzero) digits is 125, while the sum is 21.
Adding to 51111015051 its reverse (15051011115), we get a palindrome (66162026166).
The spelling of 51111015051 in words is "fifty-one billion, one hundred eleven million, fifteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •