Base | Representation |
---|---|
bin | 1100001011101… |
… | …1101011111101 |
3 | 10120011011120220 |
4 | 3002323223331 |
5 | 101040203123 |
6 | 5023131553 |
7 | 1160226540 |
oct | 302735375 |
9 | 116134526 |
10 | 51100413 |
11 | 26932551 |
12 | 15143bb9 |
13 | a782240 |
14 | 6b02857 |
15 | 4745ce3 |
hex | 30bbafd |
51100413 has 16 divisors (see below), whose sum is σ = 83857536. Its totient is φ = 26953920.
The previous prime is 51100409. The next prime is 51100429. The reversal of 51100413 is 31400115.
It is not a de Polignac number, because 51100413 - 22 = 51100409 is a prime.
It is a super-2 number, since 2×511004132 = 5222504417541138, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51100392 and 51100401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51100433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 93318 + ... + 93863.
It is an arithmetic number, because the mean of its divisors is an integer number (5241096).
Almost surely, 251100413 is an apocalyptic number.
It is an amenable number.
51100413 is a deficient number, since it is larger than the sum of its proper divisors (32757123).
51100413 is a wasteful number, since it uses less digits than its factorization.
51100413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187204.
The product of its (nonzero) digits is 60, while the sum is 15.
The square root of 51100413 is about 7148.4552876828. The cubic root of 51100413 is about 371.0861994352.
Adding to 51100413 its reverse (31400115), we get a palindrome (82500528).
The spelling of 51100413 in words is "fifty-one million, one hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •