Base | Representation |
---|---|
bin | 1100001011000… |
… | …0110111101001 |
3 | 10120001220210212 |
4 | 3002300313221 |
5 | 101032243410 |
6 | 5022150505 |
7 | 1156653422 |
oct | 302606751 |
9 | 116056725 |
10 | 51056105 |
11 | 26902231 |
12 | 15122435 |
13 | a768019 |
14 | 6ad0649 |
15 | 4737b05 |
hex | 30b0de9 |
51056105 has 4 divisors (see below), whose sum is σ = 61267332. Its totient is φ = 40844880.
The previous prime is 51056099. The next prime is 51056141. The reversal of 51056105 is 50165015.
51056105 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 50165015 = 5 ⋅10033003.
It can be written as a sum of positive squares in 2 ways, for example, as 30162064 + 20894041 = 5492^2 + 4571^2 .
It is not a de Polignac number, because 51056105 - 218 = 50793961 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5105606 + ... + 5105615.
It is an arithmetic number, because the mean of its divisors is an integer number (15316833).
Almost surely, 251056105 is an apocalyptic number.
It is an amenable number.
51056105 is a deficient number, since it is larger than the sum of its proper divisors (10211227).
51056105 is a wasteful number, since it uses less digits than its factorization.
51056105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10211226.
The product of its (nonzero) digits is 750, while the sum is 23.
The square root of 51056105 is about 7145.3554845088. The cubic root of 51056105 is about 370.9789149677.
The spelling of 51056105 in words is "fifty-one million, fifty-six thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •