Base | Representation |
---|---|
bin | 1100100110011… |
… | …01000101110010 |
3 | 21100212222220210 |
4 | 12103031011302 |
5 | 204024311100 |
6 | 14253244550 |
7 | 2422262262 |
oct | 623150562 |
9 | 240788823 |
10 | 105697650 |
11 | 54733233 |
12 | 2b493756 |
13 | 18b89cb6 |
14 | 100757a2 |
15 | 942cc50 |
hex | 64cd172 |
105697650 has 48 divisors (see below), whose sum is σ = 273536064. Its totient is φ = 26959680.
The previous prime is 105697609. The next prime is 105697661. The reversal of 105697650 is 56796501.
It is a super-2 number, since 2×1056976502 = 22343986431045000, which contains 22 as substring.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 105697599 and 105697608.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11869 + ... + 18768.
It is an arithmetic number, because the mean of its divisors is an integer number (5698668).
Almost surely, 2105697650 is an apocalyptic number.
105697650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105697650 is an abundant number, since it is smaller than the sum of its proper divisors (167838414).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105697650 is a wasteful number, since it uses less digits than its factorization.
105697650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30675 (or 30670 counting only the distinct ones).
The product of its (nonzero) digits is 56700, while the sum is 39.
The square root of 105697650 is about 10280.9362414130. The cubic root of 105697650 is about 472.8119493174.
The spelling of 105697650 in words is "one hundred five million, six hundred ninety-seven thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •