Base | Representation |
---|---|
bin | 1100100110010… |
… | …00110010110100 |
3 | 21100212002210000 |
4 | 12103020302310 |
5 | 204023230202 |
6 | 14253031300 |
7 | 2422160052 |
oct | 623106264 |
9 | 240762700 |
10 | 105680052 |
11 | 54720a95 |
12 | 2b485530 |
13 | 18b81c9a |
14 | 1006d1d2 |
15 | 942791c |
hex | 64c8cb4 |
105680052 has 60 divisors (see below), whose sum is σ = 290825920. Its totient is φ = 33370704.
The previous prime is 105680051. The next prime is 105680053. The reversal of 105680052 is 250086501.
It is an interprime number because it is at equal distance from previous prime (105680051) and next prime (105680053).
It is a super-2 number, since 2×1056800522 = 22336546781445408, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 105679998 and 105680025.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105680051) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 2428 + ... + 14739.
Almost surely, 2105680052 is an apocalyptic number.
105680052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
105680052 is an abundant number, since it is smaller than the sum of its proper divisors (185145868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105680052 is a wasteful number, since it uses less digits than its factorization.
105680052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17202 (or 17191 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
The square root of 105680052 is about 10280.0803498805. The cubic root of 105680052 is about 472.7857077800.
The spelling of 105680052 in words is "one hundred five million, six hundred eighty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •