Base | Representation |
---|---|
bin | 1100100000111… |
… | …10100010100010 |
3 | 21022112200011210 |
4 | 12100132202202 |
5 | 203333421230 |
6 | 14230050550 |
7 | 2413223661 |
oct | 620364242 |
9 | 238480153 |
10 | 104982690 |
11 | 5429505a |
12 | 2b1a9a56 |
13 | 18999747 |
14 | dd2add8 |
15 | 933aeb0 |
hex | 641e8a2 |
104982690 has 64 divisors (see below), whose sum is σ = 260467200. Its totient is φ = 27060480.
The previous prime is 104982643. The next prime is 104982707. The reversal of 104982690 is 96289401.
It is a super-2 number, since 2×1049826902 = 22042730399272200, which contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 300636 + ... + 300984.
It is an arithmetic number, because the mean of its divisors is an integer number (4069800).
Almost surely, 2104982690 is an apocalyptic number.
104982690 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 104982690, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (130233600).
104982690 is an abundant number, since it is smaller than the sum of its proper divisors (155484510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104982690 is a wasteful number, since it uses less digits than its factorization.
104982690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 667.
The product of its (nonzero) digits is 31104, while the sum is 39.
The square root of 104982690 is about 10246.1060896323. The cubic root of 104982690 is about 471.7434717552.
The spelling of 104982690 in words is "one hundred four million, nine hundred eighty-two thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •