Search a number
-
+
106413206635 = 5312287300191
BaseRepresentation
bin110001100011010111…
…0001010110001101011
3101011200010012222212101
41203012232022301223
53220413240103020
6120515140154231
710455006221641
oct1430656126153
9334603188771
10106413206635
114114753217a
1218759698977
13a05b392078
145216ab1191
152b7c29400a
hex18c6b8ac6b

106413206635 has 16 divisors (see below), whose sum is σ = 131873144832. Its totient is φ = 82348120800.

The previous prime is 106413206621. The next prime is 106413206663. The reversal of 106413206635 is 536602314601.

It is not a de Polignac number, because 106413206635 - 219 = 106412682347 is a prime.

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

It is a Duffinian number.

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

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 15 ways as a sum of consecutive naturals, for example, 204390 + ... + 504580.

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

Almost surely, 2106413206635 is an apocalyptic number.

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

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

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

The sum of its prime factors is 302514.

The product of its (nonzero) digits is 77760, while the sum is 37.

The spelling of 106413206635 in words is "one hundred six billion, four hundred thirteen million, two hundred six thousand, six hundred thirty-five".

Divisors: 1 5 31 155 2287 11435 70897 300191 354485 1500955 9305921 46529605 686536817 3432684085 21282641327 106413206635