Base | Representation |
---|---|
bin | 110010101000010110… |
… | …0011001001001010010 |
3 | 101101122102220112022020 |
4 | 1211100230121021102 |
5 | 3240133331401020 |
6 | 121540550152310 |
7 | 10566244503633 |
oct | 1452054311122 |
9 | 341572815266 |
10 | 108727997010 |
11 | 42125135476 |
12 | 190a4952696 |
13 | a339b15309 |
14 | 53962ad88a |
15 | 2c655d7c40 |
hex | 1950b19252 |
108727997010 has 128 divisors (see below), whose sum is σ = 284888254464. Its totient is φ = 26449812480.
The previous prime is 108727997009. The next prime is 108727997017. The reversal of 108727997010 is 10799727801.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (108727997017) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2853907 + ... + 2891753.
It is an arithmetic number, because the mean of its divisors is an integer number (2225689488).
Almost surely, 2108727997010 is an apocalyptic number.
108727997010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 108727997010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142444127232).
108727997010 is an abundant number, since it is smaller than the sum of its proper divisors (176160257454).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
108727997010 is a wasteful number, since it uses less digits than its factorization.
108727997010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38048.
The product of its (nonzero) digits is 444528, while the sum is 51.
The spelling of 108727997010 in words is "one hundred eight billion, seven hundred twenty-seven million, nine hundred ninety-seven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •