Search a number
-
+
110606050005050 = 2522212121000101
BaseRepresentation
bin11001001001100001111010…
…010100100001000000111010
3112111121211112210112221022102
4121021201322110201000322
5103444132142300130200
61031123415022423402
732204011012541345
oct3111417224410072
9474554483487272
10110606050005050
1132273842809066
12104a423a431b62
13499414b4851c2
141d4550b8cd45c
15cbc1b57946d5
hex64987a52103a

110606050005050 has 12 divisors (see below), whose sum is σ = 205727253009486. Its totient is φ = 44242420002000.

The previous prime is 110606050005037. The next prime is 110606050005067. The reversal of 110606050005050 is 50500050606011.

It can be written as a sum of positive squares in 3 ways, for example, as 74262357588721 + 36343692416329 = 8617561^2 + 6028573^2 .

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

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

Almost surely, 2110606050005050 is an apocalyptic number.

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

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

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

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

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

The product of its (nonzero) digits is 4500, while the sum is 29.

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

Divisors: 1 2 5 10 25 50 2212121000101 4424242000202 11060605000505 22121210001010 55303025002525 110606050005050