Base | Representation |
---|---|
bin | 110010110010000111… |
… | …0011010001111100110 |
3 | 101102111021111121221012 |
4 | 1211210032122033212 |
5 | 3241321223302020 |
6 | 122033253422222 |
7 | 10610333666216 |
oct | 1454416321746 |
9 | 342437447835 |
10 | 109055681510 |
11 | 422830a8706 |
12 | 1917663a972 |
13 | a38c987179 |
14 | 53c7a0c246 |
15 | 2c842647c5 |
hex | 196439a3e6 |
109055681510 has 32 divisors (see below), whose sum is σ = 211442614272. Its totient is φ = 40379660640.
The previous prime is 109055681491. The next prime is 109055681633. The reversal of 109055681510 is 15186550901.
It is a super-2 number, since 2×1090556815102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 7640534 + ... + 7654793.
It is an arithmetic number, because the mean of its divisors is an integer number (6607581696).
Almost surely, 2109055681510 is an apocalyptic number.
109055681510 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
109055681510 is a deficient number, since it is larger than the sum of its proper divisors (102386932762).
109055681510 is a wasteful number, since it uses less digits than its factorization.
109055681510 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15295388.
The product of its (nonzero) digits is 54000, while the sum is 41.
The spelling of 109055681510 in words is "one hundred nine billion, fifty-five million, six hundred eighty-one thousand, five hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •