Base | Representation |
---|---|
bin | 101111011111111001… |
… | …110101010101100110 |
3 | 11212122100121100020011 |
4 | 233133321311111212 |
5 | 1313422241320402 |
6 | 35232443000434 |
7 | 3453566240152 |
oct | 573771652546 |
9 | 155570540204 |
10 | 51001120102 |
11 | 1a6a1891439 |
12 | 9a7420911a |
13 | 4a6a2ac99a |
14 | 267b690062 |
15 | 14d76e7ed7 |
hex | bdfe75566 |
51001120102 has 4 divisors (see below), whose sum is σ = 76501680156. Its totient is φ = 25500560050.
The previous prime is 51001120099. The next prime is 51001120129. The reversal of 51001120102 is 20102110015.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×510011201022 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12750280024 + ... + 12750280027.
It is an arithmetic number, because the mean of its divisors is an integer number (19125420039).
Almost surely, 251001120102 is an apocalyptic number.
51001120102 is a deficient number, since it is larger than the sum of its proper divisors (25500560054).
51001120102 is a wasteful number, since it uses less digits than its factorization.
51001120102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25500560053.
The product of its (nonzero) digits is 20, while the sum is 13.
Adding to 51001120102 its reverse (20102110015), we get a palindrome (71103230117).
The spelling of 51001120102 in words is "fifty-one billion, one million, one hundred twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •