Base | Representation |
---|---|
bin | 110010111111100101… |
… | …1011101110110000101 |
3 | 101110122210102102202102 |
4 | 1211333023131312011 |
5 | 3243233010112121 |
6 | 122150210121445 |
7 | 10624464514004 |
oct | 1457713356605 |
9 | 343583372672 |
10 | 109507894661 |
11 | 42495396090 |
12 | 19281b80285 |
13 | a43257a309 |
14 | 542bac4c3b |
15 | 2cadcdd90b |
hex | 197f2ddd85 |
109507894661 has 16 divisors (see below), whose sum is σ = 123452522496. Its totient is φ = 96235230000.
The previous prime is 109507894651. The next prime is 109507894667. The reversal of 109507894661 is 166498705901.
It is a cyclic number.
It is not a de Polignac number, because 109507894661 - 26 = 109507894597 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 109507894597 and 109507894606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109507894667) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 134396 + ... + 486906.
It is an arithmetic number, because the mean of its divisors is an integer number (7715782656).
Almost surely, 2109507894661 is an apocalyptic number.
109507894661 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
109507894661 is a deficient number, since it is larger than the sum of its proper divisors (13944627835).
109507894661 is a wasteful number, since it uses less digits than its factorization.
109507894661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 353464.
The product of its (nonzero) digits is 3265920, while the sum is 56.
The spelling of 109507894661 in words is "one hundred nine billion, five hundred seven million, eight hundred ninety-four thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •