Base | Representation |
---|---|
bin | 10111001110000010110111… |
… | …10001110110100100000010 |
3 | 20200210022001221001101112110 |
4 | 23213001123301312210002 |
5 | 23143032101404310200 |
6 | 300332405143240150 |
7 | 13516654102344252 |
oct | 1347013361664402 |
9 | 220708057041473 |
10 | 51060111010050 |
11 | 152a652059258a |
12 | 588795ba49056 |
13 | 2264c424459cc |
14 | c8747315d962 |
15 | 5d82cd755b50 |
hex | 2e705bc76902 |
51060111010050 has 24 divisors (see below), whose sum is σ = 126629075305296. Its totient is φ = 13616029602640.
The previous prime is 51060111010009. The next prime is 51060111010057. The reversal of 51060111010050 is 5001011106015.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 51060111009999 and 51060111010026.
It is not an unprimeable number, because it can be changed into a prime (51060111010057) 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, 170200369884 + ... + 170200370183.
It is an arithmetic number, because the mean of its divisors is an integer number (5276211471054).
Almost surely, 251060111010050 is an apocalyptic number.
51060111010050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
51060111010050 is an abundant number, since it is smaller than the sum of its proper divisors (75568964295246).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51060111010050 is a wasteful number, since it uses less digits than its factorization.
51060111010050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 340400740082 (or 340400740077 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 51060111010050 its reverse (5001011106015), we get a palindrome (56061122116065).
The spelling of 51060111010050 in words is "fifty-one trillion, sixty billion, one hundred eleven million, ten thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •