Search a number
-
+
106052154032 = 2411602569057
BaseRepresentation
bin110001011000100110…
…0110111001010110000
3101010201221211121210202
41202301030313022300
53214143322412112
6120415241414332
710443033302306
oct1426114671260
9333657747722
10106052154032
1140a81748aa0
121867879a3a8
13a001639186
1451c0b68276
152b5a7256c2
hex18b13372b0

106052154032 has 20 divisors (see below), whose sum is σ = 224155689576. Its totient is φ = 48205524480.

The previous prime is 106052154007. The next prime is 106052154071. The reversal of 106052154032 is 230451250601.

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

It is a junction number, because it is equal to n+sod(n) for n = 106052153986 and 106052154004.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 301284353 + ... + 301284704.

Almost surely, 2106052154032 is an apocalyptic number.

It is an amenable number.

106052154032 is an abundant number, since it is smaller than the sum of its proper divisors (118103535544).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

The spelling of 106052154032 in words is "one hundred six billion, fifty-two million, one hundred fifty-four thousand, thirty-two".

Divisors: 1 2 4 8 11 16 22 44 88 176 602569057 1205138114 2410276228 4820552456 6628259627 9641104912 13256519254 26513038508 53026077016 106052154032