Base | Representation |
---|---|
bin | 1100001011101… |
… | …0001101111101 |
3 | 10120010212100002 |
4 | 3002322031331 |
5 | 101040010042 |
6 | 5023044045 |
7 | 1160203154 |
oct | 302721575 |
9 | 116125302 |
10 | 51094397 |
11 | 26928a82 |
12 | 15140625 |
13 | a77c593 |
14 | 6b0059b |
15 | 4744132 |
hex | 30ba37d |
51094397 has 4 divisors (see below), whose sum is σ = 51110076. Its totient is φ = 51078720.
The previous prime is 51094391. The next prime is 51094399. The reversal of 51094397 is 79349015.
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 14055001 + 37039396 = 3749^2 + 6086^2 .
It is a cyclic number.
It is not a de Polignac number, because 51094397 - 218 = 50832253 is a prime.
It is a super-2 number, since 2×510943972 = 5221274809587218, which contains 22 as substring.
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 51094397.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51094391) 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, 908 + ... + 10149.
It is an arithmetic number, because the mean of its divisors is an integer number (12777519).
Almost surely, 251094397 is an apocalyptic number.
It is an amenable number.
51094397 is a deficient number, since it is larger than the sum of its proper divisors (15679).
51094397 is a wasteful number, since it uses less digits than its factorization.
51094397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15678.
The product of its (nonzero) digits is 34020, while the sum is 38.
The square root of 51094397 is about 7148.0344850875. The cubic root of 51094397 is about 371.0716363292.
The spelling of 51094397 in words is "fifty-one million, ninety-four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •