Search a number
-
+
105001005056050 = 2522100020101121
BaseRepresentation
bin10111110111111101110011…
…100110111000000000110010
3111202202222221120121210102001
4113313331303212320000302
5102230314024243243200
61011152443521044214
731055033534554105
oct2767756346700062
9452688846553361
10105001005056050
1130502748a90174
12b939a9418666a
1346787244c781c
141bd010bc6073c
15c214b537076a
hex5f7f739b8032

105001005056050 has 12 divisors (see below), whose sum is σ = 195301869404346. Its totient is φ = 42000402022400.

The previous prime is 105001005055963. The next prime is 105001005056081. The reversal of 105001005056050 is 50650500100501.

It can be written as a sum of positive squares in 3 ways, for example, as 93852558189009 + 11148446867041 = 9687753^2 + 3338929^2 .

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

It is an unprimeable number.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1050010050511 + ... + 1050010050610.

Almost surely, 2105001005056050 is an apocalyptic number.

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

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

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

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

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

The product of its (nonzero) digits is 3750, while the sum is 28.

Adding to 105001005056050 its reverse (50650500100501), we get a palindrome (155651505156551).

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

Divisors: 1 2 5 10 25 50 2100020101121 4200040202242 10500100505605 21000201011210 52500502528025 105001005056050