[go: up one dir, main page]

Search a number
-
+
51105093 = 3132100799
BaseRepresentation
bin1100001011110…
…0110101000101
310120011102000020
43002330311011
5101040330333
65023205353
71160246304
oct302746505
9116142006
1051105093
1126936016
1215146859
13a784400
146b0443b
1547473b3
hex30bcd45

51105093 has 12 divisors (see below), whose sum is σ = 73785600. Its totient is φ = 31448976.

The previous prime is 51105083. The next prime is 51105101. The reversal of 51105093 is 39050115.

51105093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 51105093 - 213 = 51096901 is a prime.

It is a super-2 number, since 2×511050932 = 5223461061077298, which contains 22 as substring.

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (51105013) 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 11 ways as a sum of consecutive naturals, for example, 49893 + ... + 50906.

It is an arithmetic number, because the mean of its divisors is an integer number (6148800).

Almost surely, 251105093 is an apocalyptic number.

It is an amenable number.

51105093 is a deficient number, since it is larger than the sum of its proper divisors (22680507).

51105093 is a wasteful number, since it uses less digits than its factorization.

51105093 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 100828 (or 100815 counting only the distinct ones).

The product of its (nonzero) digits is 675, while the sum is 24.

The square root of 51105093 is about 7148.7826236360. The cubic root of 51105093 is about 371.0975276568.

The spelling of 51105093 in words is "fifty-one million, one hundred five thousand, ninety-three".

Divisors: 1 3 13 39 169 507 100799 302397 1310387 3931161 17035031 51105093