Base | Representation |
---|---|
bin | 1100001111001… |
… | …0110001100110 |
3 | 10120120122002222 |
4 | 3003302301212 |
5 | 101114413204 |
6 | 5032032342 |
7 | 1162156433 |
oct | 303626146 |
9 | 116518088 |
10 | 51326054 |
11 | 26a7702a |
12 | 152326b2 |
13 | a830b60 |
14 | 6b60b8a |
15 | 478cabe |
hex | 30f2c66 |
51326054 has 8 divisors (see below), whose sum is σ = 82911360. Its totient is φ = 23688936.
The previous prime is 51326017. The next prime is 51326059. The reversal of 51326054 is 45062315.
51326054 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (26), and also a Moran number because the ratio is a prime number: 1974079 = 51326054 / (5 + 1 + 3 + 2 + 6 + 0 + 5 + 4).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51326059) by changing a digit.
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, 987014 + ... + 987065.
It is an arithmetic number, because the mean of its divisors is an integer number (10363920).
Almost surely, 251326054 is an apocalyptic number.
51326054 is a deficient number, since it is larger than the sum of its proper divisors (31585306).
51326054 is a wasteful number, since it uses less digits than its factorization.
51326054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1974094.
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 51326054 is about 7164.2204042031. The cubic root of 51326054 is about 371.6315917575.
Adding to 51326054 its reverse (45062315), we get a palindrome (96388369).
The spelling of 51326054 in words is "fifty-one million, three hundred twenty-six thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •