Search a number
-
+
105010056010 = 2552120155481
BaseRepresentation
bin110000111001100010…
…1100100101101001010
3101001001022221120001201
41201303011210231022
53210030033243020
6120124013534414
710405150514536
oct1416305445512
9331038846051
10105010056010
1140597491362
12184277a440a
139b9677c522
1451225bcbc6
152ae8ecaa0a
hex1873164b4a

105010056010 has 16 divisors (see below), whose sum is σ = 189380908872. Its totient is φ = 41923398400.

The previous prime is 105010056001. The next prime is 105010056013. The reversal of 105010056010 is 10650010501.

It can be written as a sum of positive squares in 4 ways, for example, as 80615677041 + 24394378969 = 283929^2 + 156187^2 .

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

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

Almost surely, 2105010056010 is an apocalyptic number.

105010056010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 20156009.

The product of its (nonzero) digits is 150, while the sum is 19.

Adding to 105010056010 its reverse (10650010501), we get a palindrome (115660066511).

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

Divisors: 1 2 5 10 521 1042 2605 5210 20155481 40310962 100777405 201554810 10501005601 21002011202 52505028005 105010056010