Base | Representation |
---|---|
bin | 101110001011… |
… | …011011110100 |
3 | 211210000120101 |
4 | 232023123310 |
5 | 11044333320 |
6 | 1111243444 |
7 | 204615613 |
oct | 56133364 |
9 | 24700511 |
10 | 12105460 |
11 | 6919014 |
12 | 4079584 |
13 | 267acc3 |
14 | 187187a |
15 | 10e1c0a |
hex | b8b6f4 |
12105460 has 24 divisors (see below), whose sum is σ = 25489800. Its totient is φ = 4829184.
The previous prime is 12105433. The next prime is 12105463. The reversal of 12105460 is 6450121.
It can be written as a sum of positive squares in 4 ways, for example, as 7551504 + 4553956 = 2748^2 + 2134^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12105463) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11016 + ... + 12064.
It is an arithmetic number, because the mean of its divisors is an integer number (1062075).
Almost surely, 212105460 is an apocalyptic number.
12105460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12105460 is an abundant number, since it is smaller than the sum of its proper divisors (13384340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12105460 is a wasteful number, since it uses less digits than its factorization.
12105460 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1635 (or 1633 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 12105460 is about 3479.2901574890. The cubic root of 12105460 is about 229.6115686968.
Adding to 12105460 its reverse (6450121), we get a palindrome (18555581).
It can be divided in two parts, 1210 and 5460, that added together give a triangular number (6670 = T115).
The spelling of 12105460 in words is "twelve million, one hundred five thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •