Search a number
-
+
10500056012 = 222625014003
BaseRepresentation
bin10011100011101101…
…00010001111001100
31000002202201010000102
421301312202033030
5133001003243022
64453524350232
7521126001125
oct116166421714
930082633012
1010500056012
1144a900a546
122050545378
13cb4491bc4
1471873104c
15416c37a92
hex271da23cc

10500056012 has 6 divisors (see below), whose sum is σ = 18375098028. Its totient is φ = 5250028004.

The previous prime is 10500056011. The next prime is 10500056057. The reversal of 10500056012 is 21065000501.

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

It is a super-2 number, since 2×105000560122 (a number of 21 digits) contains 22 as substring.

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

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

Almost surely, 210500056012 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 10500056012 its reverse (21065000501), we get a palindrome (31565056513).

The spelling of 10500056012 in words is "ten billion, five hundred million, fifty-six thousand, twelve".

Divisors: 1 2 4 2625014003 5250028006 10500056012