Base | Representation |
---|---|
bin | 101000101101… |
… | …000000110010 |
3 | 202002002200000 |
4 | 220231000302 |
5 | 10212421010 |
6 | 1020410430 |
7 | 156460152 |
oct | 50550062 |
9 | 22062600 |
10 | 10670130 |
11 | 6028699 |
12 | 36a6a16 |
13 | 22978b3 |
14 | 15ba762 |
15 | e0b7c0 |
hex | a2d032 |
10670130 has 48 divisors (see below), whose sum is σ = 28776384. Its totient is φ = 2844720.
The previous prime is 10670129. The next prime is 10670141. The reversal of 10670130 is 3107601.
It is a super-2 number, since 2×106701302 = 227703348433800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 235 + ... + 4625.
It is an arithmetic number, because the mean of its divisors is an integer number (599508).
Almost surely, 210670130 is an apocalyptic number.
10670130 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 10670130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14388192).
10670130 is an abundant number, since it is smaller than the sum of its proper divisors (18106254).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10670130 is an equidigital number, since it uses as much as digits as its factorization.
10670130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4413 (or 4401 counting only the distinct ones).
The product of its (nonzero) digits is 126, while the sum is 18.
The square root of 10670130 is about 3266.5164931468. The cubic root of 10670130 is about 220.1523050039.
Adding to 10670130 its reverse (3107601), we get a palindrome (13777731).
The spelling of 10670130 in words is "ten million, six hundred seventy thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •