Search a number
-
+
106533385970 = 25112813446567
BaseRepresentation
bin110001100110111100…
…0100111011011110010
3101011222111100201220212
41203031320213123302
53221140021322340
6120535112104122
710460665561004
oct1431570473362
9334874321825
10106533385970
11411a9356740
1218791995042
13a07a24c7bb
145228a36374
152b87ad2a65
hex18cde276f2

106533385970 has 32 divisors (see below), whose sum is σ = 209937350016. Its totient is φ = 38601539200.

The previous prime is 106533385969. The next prime is 106533385997. The reversal of 106533385970 is 79583335601.

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

It is a Curzon number.

It is an unprimeable number.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1692374 + ... + 1754193.

It is an arithmetic number, because the mean of its divisors is an integer number (6560542188).

Almost surely, 2106533385970 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 3446866.

The product of its (nonzero) digits is 2041200, while the sum is 50.

The spelling of 106533385970 in words is "one hundred six billion, five hundred thirty-three million, three hundred eighty-five thousand, nine hundred seventy".

Divisors: 1 2 5 10 11 22 55 110 281 562 1405 2810 3091 6182 15455 30910 3446567 6893134 17232835 34465670 37912237 75824474 189561185 379122370 968485327 1936970654 4842426635 9684853270 10653338597 21306677194 53266692985 106533385970