Base | Representation |
---|---|
bin | 110010110001110110… |
… | …0110111111100000000 |
3 | 101102110122221222120121 |
4 | 1211203230313330000 |
5 | 3241312000441430 |
6 | 122032341150024 |
7 | 10610166162541 |
oct | 1454354677400 |
9 | 342418858517 |
10 | 109046890240 |
11 | 422791436a2 |
12 | 191736bb314 |
13 | a38abc9832 |
14 | 53c67a04c8 |
15 | 2c835c9a7a |
hex | 1963b37f00 |
109046890240 has 72 divisors (see below), whose sum is σ = 261301566960. Its totient is φ = 43602026496.
The previous prime is 109046890193. The next prime is 109046890261. The reversal of 109046890240 is 42098640901.
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 7 ways as a sum of consecutive naturals, for example, 3642051 + ... + 3671869.
It is an arithmetic number, because the mean of its divisors is an integer number (3629188430).
Almost surely, 2109046890240 is an apocalyptic number.
109046890240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 109046890240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (130650783480).
109046890240 is an abundant number, since it is smaller than the sum of its proper divisors (152254676720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109046890240 is an equidigital number, since it uses as much as digits as its factorization.
109046890240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32697 (or 32683 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 43.
The spelling of 109046890240 in words is "one hundred nine billion, forty-six million, eight hundred ninety thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •