Base | Representation |
---|---|
bin | 1100010000100… |
… | …0001001111011 |
3 | 10120202002020102 |
4 | 3010020021323 |
5 | 101130214002 |
6 | 5033550015 |
7 | 1163002646 |
oct | 304101173 |
9 | 116662212 |
10 | 51413627 |
11 | 27026901 |
12 | 1527530b |
13 | a861985 |
14 | 6b84a5d |
15 | 47a8a02 |
hex | 310827b |
51413627 has 8 divisors (see below), whose sum is σ = 54507456. Its totient is φ = 48327552.
The previous prime is 51413617. The next prime is 51413641. The reversal of 51413627 is 72631415.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51413627 - 24 = 51413611 is a prime.
It is a super-2 number, since 2×514136272 = 5286722082590258, 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 51413627.
It is not an unprimeable number, because it can be changed into a prime (51413617) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17198 + ... + 19964.
It is an arithmetic number, because the mean of its divisors is an integer number (6813432).
Almost surely, 251413627 is an apocalyptic number.
51413627 is a deficient number, since it is larger than the sum of its proper divisors (3093829).
51413627 is a wasteful number, since it uses less digits than its factorization.
51413627 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3877.
The product of its digits is 5040, while the sum is 29.
The square root of 51413627 is about 7170.3296298009. The cubic root of 51413627 is about 371.8428321115.
It can be divided in two parts, 514 and 13627, that added together give a palindrome (14141).
The spelling of 51413627 in words is "fifty-one million, four hundred thirteen thousand, six hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •