Base | Representation |
---|---|
bin | 110011000011011000… |
… | …0101011101000011100 |
3 | 101110222122202200021220 |
4 | 1212012300223220130 |
5 | 3244013040402342 |
6 | 122210552253340 |
7 | 10630600616511 |
oct | 1460660535034 |
9 | 343878680256 |
10 | 109635090972 |
11 | 42550172600 |
12 | 192b86a1250 |
13 | a452a238c4 |
14 | 5440955308 |
15 | 2cba0665ec |
hex | 1986c2ba1c |
109635090972 has 144 divisors (see below), whose sum is σ = 284377986816. Its totient is φ = 32847091200.
The previous prime is 109635090937. The next prime is 109635090973. The reversal of 109635090972 is 279090536901.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109635090973) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 113376033 + ... + 113376999.
Almost surely, 2109635090972 is an apocalyptic number.
109635090972 is a gapful number since it is divisible by the number (12) 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 109635090972, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142188993408).
109635090972 is an abundant number, since it is smaller than the sum of its proper divisors (174742895844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109635090972 is a wasteful number, since it uses less digits than its factorization.
109635090972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1800 (or 1787 counting only the distinct ones).
The product of its (nonzero) digits is 918540, while the sum is 51.
The spelling of 109635090972 in words is "one hundred nine billion, six hundred thirty-five million, ninety thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •