Search a number
-
+
106240046633 = 7212163178259
BaseRepresentation
bin110001011110001100…
…1100111011000101001
3101011020001101112222222
41202330121213120221
53220034422443013
6120450032523425
710450504332200
oct1427431473051
9334201345888
10106240046633
1141068811536
121870b6b0575
13a031544626
1451dbab8237
152b6be8c508
hex18bc667629

106240046633 has 12 divisors (see below), whose sum is σ = 123596214480. Its totient is φ = 91054899432.

The previous prime is 106240046617. The next prime is 106240046639. The reversal of 106240046633 is 336640042601.

It is not a de Polignac number, because 106240046633 - 24 = 106240046617 is a prime.

It is a super-2 number, since 2×1062400466332 (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 = 106240046593 and 106240046602.

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

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 11 ways as a sum of consecutive naturals, for example, 506858 + ... + 685116.

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

Almost surely, 2106240046633 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 62208, while the sum is 35.

The spelling of 106240046633 in words is "one hundred six billion, two hundred forty million, forty-six thousand, six hundred thirty-three".

Divisors: 1 7 49 12163 85141 178259 595987 1247813 8734691 2168164217 15177149519 106240046633