Base | Representation |
---|---|
bin | 110010110101010001… |
… | …0001000010000000011 |
3 | 101102202122122110210120 |
4 | 1211222202020100003 |
5 | 3242030321421422 |
6 | 122051554031323 |
7 | 10613060362551 |
oct | 1455242102003 |
9 | 342678573716 |
10 | 109161513987 |
11 | 42327913169 |
12 | 191a5b78543 |
13 | a3a8890636 |
14 | 53d7ababd1 |
15 | 2c8d6bc45c |
hex | 196a888403 |
109161513987 has 16 divisors (see below), whose sum is σ = 146945904000. Its totient is φ = 72078234624.
The previous prime is 109161513977. The next prime is 109161514013. The reversal of 109161513987 is 789315161901.
It is not a de Polignac number, because 109161513987 - 28 = 109161513731 is a prime.
It is a super-2 number, since 2×1091615139872 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (109161513977) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 137662 + ... + 487107.
It is an arithmetic number, because the mean of its divisors is an integer number (9184119000).
Almost surely, 2109161513987 is an apocalyptic number.
109161513987 is a deficient number, since it is larger than the sum of its proper divisors (37784390013).
109161513987 is a wasteful number, since it uses less digits than its factorization.
109161513987 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 625330.
The product of its (nonzero) digits is 408240, while the sum is 51.
The spelling of 109161513987 in words is "one hundred nine billion, one hundred sixty-one million, five hundred thirteen thousand, nine hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •