Search a number
-
+
109155023690 = 2510915502369
BaseRepresentation
bin110010110101000100…
…1010111101101001010
3101102202012102201210012
41211222021113231022
53242022141224230
6122051202551522
710612651251446
oct1455211275512
9342665381705
10109155023690
114232418a989
12191a39685a2
13a3a742a41b
1453d6cab826
152c8cd39395
hex196a257b4a

109155023690 has 8 divisors (see below), whose sum is σ = 196479042660. Its totient is φ = 43662009472.

The previous prime is 109155023687. The next prime is 109155023713. The reversal of 109155023690 is 96320551901.

It is a happy number.

109155023690 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 2 ways, for example, as 103122550129 + 6032473561 = 321127^2 + 77669^2 .

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

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

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 3 ways as a sum of consecutive naturals, for example, 5457751175 + ... + 5457751194.

Almost surely, 2109155023690 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 10915502376.

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

The spelling of 109155023690 in words is "one hundred nine billion, one hundred fifty-five million, twenty-three thousand, six hundred ninety".

Divisors: 1 2 5 10 10915502369 21831004738 54577511845 109155023690