Base | Representation |
---|---|
bin | 101000101101… |
… | …101110111000 |
3 | 202002020201021 |
4 | 220231232320 |
5 | 10213014310 |
6 | 1020432224 |
7 | 156501565 |
oct | 50555670 |
9 | 22066637 |
10 | 10673080 |
11 | 602a930 |
12 | 36a8674 |
13 | 2299042 |
14 | 15bb86c |
15 | e0c5da |
hex | a2dbb8 |
10673080 has 64 divisors (see below), whose sum is σ = 26542080. Its totient is φ = 3830400.
The previous prime is 10673071. The next prime is 10673099. The reversal of 10673080 is 8037601.
It is a super-2 number, since 2×106730802 = 227829273372800, which contains 22 as substring.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 55785 + ... + 55975.
It is an arithmetic number, because the mean of its divisors is an integer number (414720).
Almost surely, 210673080 is an apocalyptic number.
10673080 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10673080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13271040).
10673080 is an abundant number, since it is smaller than the sum of its proper divisors (15869000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10673080 is a wasteful number, since it uses less digits than its factorization.
10673080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340 (or 336 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 25.
The square root of 10673080 is about 3266.9680133114. The cubic root of 10673080 is about 220.1725918376.
The spelling of 10673080 in words is "ten million, six hundred seventy-three thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •