Base | Representation |
---|---|
bin | 10111001111011111111111… |
… | …11101000101110111100001 |
3 | 20200222002010110002021221022 |
4 | 23213233333331011313201 |
5 | 23144342001133410001 |
6 | 300411354352335225 |
7 | 13523404113302216 |
oct | 1347577775056741 |
9 | 220862113067838 |
10 | 51110110060001 |
11 | 15315748766873 |
12 | 5895594544515 |
13 | 226987cc42175 |
14 | c89a576c3b0d |
15 | 5d9757eae11b |
hex | 2e7bfff45de1 |
51110110060001 has 16 divisors (see below), whose sum is σ = 54462642591744. Its totient is φ = 47796043486464.
The previous prime is 51110110059979. The next prime is 51110110060007. The reversal of 51110110060001 is 10006001101115.
It is not a de Polignac number, because 51110110060001 - 230 = 51109036318177 is a prime.
It is a super-2 number, since 2×511101100600012 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (51110110060007) 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, 117119456 + ... + 117555038.
It is an arithmetic number, because the mean of its divisors is an integer number (3403915161984).
Almost surely, 251110110060001 is an apocalyptic number.
It is an amenable number.
51110110060001 is a deficient number, since it is larger than the sum of its proper divisors (3352532531743).
51110110060001 is a wasteful number, since it uses less digits than its factorization.
51110110060001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 479720.
The product of its (nonzero) digits is 30, while the sum is 17.
Adding to 51110110060001 its reverse (10006001101115), we get a palindrome (61116111161116).
The spelling of 51110110060001 in words is "fifty-one trillion, one hundred ten billion, one hundred ten million, sixty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •