Base | Representation |
---|---|
bin | 1100110111001… |
… | …01110110111010 |
3 | 21112000200211102 |
4 | 12123211312322 |
5 | 210110140000 |
6 | 14412331402 |
7 | 2450050220 |
oct | 633456672 |
9 | 245020742 |
10 | 107896250 |
11 | 559a5060 |
12 | 30173b62 |
13 | 19479947 |
14 | 10488b10 |
15 | 97143d5 |
hex | 66e5dba |
107896250 has 160 divisors (see below), whose sum is σ = 269913600. Its totient is φ = 31320000.
The previous prime is 107896249. The next prime is 107896253. The reversal of 107896250 is 52698701.
It is a sliding number, since 107896250 = 10240000 + 97656250 and 1/10240000 + 1/97656250 = 0.000000107896250.
It is a Harshad number since it is a multiple of its sum of digits (38).
It is not an unprimeable number, because it can be changed into a prime (107896253) 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 79 ways as a sum of consecutive naturals, for example, 1828721 + ... + 1828779.
It is an arithmetic number, because the mean of its divisors is an integer number (1686960).
Almost surely, 2107896250 is an apocalyptic number.
107896250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
107896250 is an abundant number, since it is smaller than the sum of its proper divisors (162017350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107896250 is a wasteful number, since it uses less digits than its factorization.
107896250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118 (or 103 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 38.
The square root of 107896250 is about 10387.3119718241. The cubic root of 107896250 is about 476.0677733455.
The spelling of 107896250 in words is "one hundred seven million, eight hundred ninety-six thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •