[go: up one dir, main page]

Search a number
-
+
51154022 = 225577011
BaseRepresentation
bin1100001100100…
…0110001100110
310120020220010102
43003020301212
5101043412042
65024224102
71160542043
oct303106146
9116226112
1051154022
1126969857
121516b032
13a7a076a
146b181ca
154756b32
hex30c8c66

51154022 has 4 divisors (see below), whose sum is σ = 76731036. Its totient is φ = 25577010.

The previous prime is 51154021. The next prime is 51154043. The reversal of 51154022 is 22045115.

It is a semiprime because it is the product of two primes.

It is a junction number, because it is equal to n+sod(n) for n = 51153985 and 51154003.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (51154021) 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 as a sum of consecutive naturals, namely, 12788504 + ... + 12788507.

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

Almost surely, 251154022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 25577013.

The product of its (nonzero) digits is 400, while the sum is 20.

The square root of 51154022 is about 7152.2039959722. The cubic root of 51154022 is about 371.2159218532.

Adding to 51154022 its reverse (22045115), we get a palindrome (73199137).

The spelling of 51154022 in words is "fifty-one million, one hundred fifty-four thousand, twenty-two".

Divisors: 1 2 25577011 51154022