Base | Representation |
---|---|
bin | 110010110100011110… |
… | …0011101001110000110 |
3 | 101102200210111101000221 |
4 | 1211220330131032012 |
5 | 3242002011024230 |
6 | 122045202454554 |
7 | 10612315004605 |
oct | 1455074351606 |
9 | 342623441027 |
10 | 109134861190 |
11 | 42313869563 |
12 | 1919906445a |
13 | a3a31bb054 |
14 | 53d433da3c |
15 | 2c8b1a527a |
hex | 1968f1d386 |
109134861190 has 32 divisors (see below), whose sum is σ = 199883842560. Its totient is φ = 42890084064.
The previous prime is 109134861169. The next prime is 109134861193. The reversal of 109134861190 is 91168431901.
It is a happy number.
It is a super-2 number, since 2×1091348611902 (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 (109134861193) 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 15 ways as a sum of consecutive naturals, for example, 1024837 + ... + 1126303.
It is an arithmetic number, because the mean of its divisors is an integer number (6246370080).
Almost surely, 2109134861190 is an apocalyptic number.
109134861190 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
109134861190 is a deficient number, since it is larger than the sum of its proper divisors (90748981370).
109134861190 is a wasteful number, since it uses less digits than its factorization.
109134861190 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103356.
The product of its (nonzero) digits is 46656, while the sum is 43.
The spelling of 109134861190 in words is "one hundred nine billion, one hundred thirty-four million, eight hundred sixty-one thousand, one hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •