Search a number
-
+
109226033690 = 2510922603369
BaseRepresentation
bin110010110111001100…
…0010000001000011010
3101102221011001102012012
41211232120100020122
53242143331034230
6122102220545522
710614502652624
oct1455630201032
9342834042165
10109226033690
1142360280834
12192036b22a2
13a3b9060887
1454024b3c14
152c941b4395
hex196e61021a

109226033690 has 8 divisors (see below), whose sum is σ = 196606860660. Its totient is φ = 43690413472.

The previous prime is 109226033689. The next prime is 109226033699. The reversal of 109226033690 is 96330622901.

It can be written as a sum of positive squares in 2 ways, for example, as 109162177609 + 63856081 = 330397^2 + 7991^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is a Curzon number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5461301675 + ... + 5461301694.

Almost surely, 2109226033690 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 10922603376.

The product of its (nonzero) digits is 104976, while the sum is 41.

The spelling of 109226033690 in words is "one hundred nine billion, two hundred twenty-six million, thirty-three thousand, six hundred ninety".

Divisors: 1 2 5 10 10922603369 21845206738 54613016845 109226033690