Search a number
-
+
56010122 = 274000723
BaseRepresentation
bin1101010110101…
…0010110001010
310220101121102222
43111222112022
5103314310442
65320254042
71250035550
oct325522612
9126347388
1056010122
1129686263
1216911322
13b7b0bac
14761dbd0
154db58d2
hex356a58a

56010122 has 8 divisors (see below), whose sum is σ = 96017376. Its totient is φ = 24004332.

The previous prime is 56010077. The next prime is 56010127. The reversal of 56010122 is 22101065.

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

It is a sphenic number, since it is the product of 3 distinct primes.

It is a self number, because there is not a number n which added to its sum of digits gives 56010122.

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

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

Almost surely, 256010122 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4000732.

The product of its (nonzero) digits is 120, while the sum is 17.

The square root of 56010122 is about 7483.9910475628. The cubic root of 56010122 is about 382.6092859866.

Adding to 56010122 its reverse (22101065), we get a palindrome (78111187).

The spelling of 56010122 in words is "fifty-six million, ten thousand, one hundred twenty-two".

Divisors: 1 2 7 14 4000723 8001446 28005061 56010122