Base | Representation |
---|---|
bin | 101111011111111001… |
… | …110101010101100101 |
3 | 11212122100121100020010 |
4 | 233133321311111211 |
5 | 1313422241320401 |
6 | 35232443000433 |
7 | 3453566240151 |
oct | 573771652545 |
9 | 155570540203 |
10 | 51001120101 |
11 | 1a6a1891438 |
12 | 9a74209119 |
13 | 4a6a2ac999 |
14 | 267b690061 |
15 | 14d76e7ed6 |
hex | bdfe75565 |
51001120101 has 12 divisors (see below), whose sum is σ = 71768890752. Its totient is φ = 32211233064.
The previous prime is 51001120099. The next prime is 51001120129. The reversal of 51001120101 is 10102110015.
It is not a de Polignac number, because 51001120101 - 21 = 51001120099 is a prime.
It is a super-2 number, since 2×510011201012 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51001120171) 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, 23545141 + ... + 23547306.
It is an arithmetic number, because the mean of its divisors is an integer number (5980740896).
Almost surely, 251001120101 is an apocalyptic number.
It is an amenable number.
51001120101 is a deficient number, since it is larger than the sum of its proper divisors (20767770651).
51001120101 is a wasteful number, since it uses less digits than its factorization.
51001120101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47092488 (or 47092469 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 12.
Adding to 51001120101 its reverse (10102110015), we get a palindrome (61103230116).
The spelling of 51001120101 in words is "fifty-one billion, one million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •