Search a number
-
+
106000560050050 = 2522120011201001
BaseRepresentation
bin11000000110100000101101…
…101110100100111110000010
3111220022112222021200120102101
4120012200231232210332002
5102343203121333100200
61013235552433341014
731220200460043421
oct3006405556447602
9456275867616371
10106000560050050
11308586487a0506
12ba7b75110776a
13471ba6b5247b3
141c266511492b8
15c3c4b79d326a
hex60682dba4f82

106000560050050 has 12 divisors (see below), whose sum is σ = 197161041693186. Its totient is φ = 42400224020000.

The previous prime is 106000560049973. The next prime is 106000560050051. The reversal of 106000560050050 is 50050065000601.

It can be written as a sum of positive squares in 3 ways, for example, as 102957164661961 + 3043395388089 = 10146781^2 + 1744533^2 .

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

It is not an unprimeable number, because it can be changed into a prime (106000560050051) by changing a digit.

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

Almost surely, 2106000560050050 is an apocalyptic number.

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

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

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

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

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

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

The spelling of 106000560050050 in words is "one hundred six trillion, five hundred sixty million, fifty thousand, fifty".

Divisors: 1 2 5 10 25 50 2120011201001 4240022402002 10600056005005 21200112010010 53000280025025 106000560050050