Base | Representation |
---|---|
bin | 100110101101… |
… | …101001101100 |
3 | 201002121001220 |
4 | 212231221230 |
5 | 10044222320 |
6 | 1001303340 |
7 | 152155230 |
oct | 46555154 |
9 | 21077056 |
10 | 10148460 |
11 | 5801763 |
12 | 3494b50 |
13 | 214430a |
14 | 14c25c0 |
15 | d56e40 |
hex | 9ada6c |
10148460 has 96 divisors (see below), whose sum is σ = 33019392. Its totient is φ = 2280960.
The previous prime is 10148441. The next prime is 10148477. The reversal of 10148460 is 6484101.
It is a self number, because there is not a number n which added to its sum of digits gives 10148460.
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 31 ways as a sum of consecutive naturals, for example, 30495 + ... + 30825.
It is an arithmetic number, because the mean of its divisors is an integer number (343952).
Almost surely, 210148460 is an apocalyptic number.
10148460 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 10148460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16509696).
10148460 is an abundant number, since it is smaller than the sum of its proper divisors (22870932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10148460 is a wasteful number, since it uses less digits than its factorization.
10148460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 423 (or 421 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 24.
The square root of 10148460 is about 3185.6647657907. The cubic root of 10148460 is about 216.5043939464.
The spelling of 10148460 in words is "ten million, one hundred forty-eight thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •