Search a number
-
+
106326234550 = 2522126524691
BaseRepresentation
bin110001100000110001…
…0011001010110110110
3101011110001120100121001
41203001202121112312
53220224004001200
6120502352113514
710452602040004
oct1430142312666
9334401510531
10106326234550
1141102429818
121873453589a
13a0463603b3
145209311a74
152b7481476a
hex18c18995b6

106326234550 has 12 divisors (see below), whose sum is σ = 197766796356. Its totient is φ = 42530493800.

The previous prime is 106326234541. The next prime is 106326234551. The reversal of 106326234550 is 55432623601.

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

It is a congruent number.

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

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 5 ways as a sum of consecutive naturals, for example, 1063262296 + ... + 1063262395.

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

Almost surely, 2106326234550 is an apocalyptic number.

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

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

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

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

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

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

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

Divisors: 1 2 5 10 25 50 2126524691 4253049382 10632623455 21265246910 53163117275 106326234550