Base | Representation |
---|---|
bin | 101111100010111000… |
… | …010011011111111001 |
3 | 11212202211120002112201 |
4 | 233202320103133321 |
5 | 1314023032113001 |
6 | 35241425110201 |
7 | 3455043526246 |
oct | 574270233771 |
9 | 155684502481 |
10 | 51051051001 |
11 | 1a717a95245 |
12 | 9a88a88361 |
13 | 4a777427b2 |
14 | 268416a5cd |
15 | 14dbcac501 |
hex | be2e137f9 |
51051051001 has 4 divisors (see below), whose sum is σ = 52811432100. Its totient is φ = 49290669904.
The previous prime is 51051050987. The next prime is 51051051011. The reversal of 51051051001 is 10015015015.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 25753830400 + 25297220601 = 160480^2 + 159051^2 .
It is a cyclic number.
It is not a de Polignac number, because 51051051001 - 25 = 51051050969 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 51051051001.
It is not an unprimeable number, because it can be changed into a prime (51051051011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 880190506 + ... + 880190563.
It is an arithmetic number, because the mean of its divisors is an integer number (13202858025).
Almost surely, 251051051001 is an apocalyptic number.
It is an amenable number.
51051051001 is a deficient number, since it is larger than the sum of its proper divisors (1760381099).
51051051001 is a wasteful number, since it uses less digits than its factorization.
51051051001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1760381098.
The product of its (nonzero) digits is 125, while the sum is 19.
Adding to 51051051001 its reverse (10015015015), we get a palindrome (61066066016).
The spelling of 51051051001 in words is "fifty-one billion, fifty-one million, fifty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •