Base | Representation |
---|---|
bin | 100111111010… |
… | …000100110100 |
3 | 201200111110200 |
4 | 213322010310 |
5 | 10134231432 |
6 | 1012120500 |
7 | 154630656 |
oct | 47720464 |
9 | 21614420 |
10 | 10461492 |
11 | 59a5968 |
12 | 3606130 |
13 | 2223942 |
14 | 15646d6 |
15 | db9a7c |
hex | 9fa134 |
10461492 has 18 divisors (see below), whose sum is σ = 26444418. Its totient is φ = 3487152.
The previous prime is 10461461. The next prime is 10461499. The reversal of 10461492 is 29416401.
10461492 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 7817616 + 2643876 = 2796^2 + 1626^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10461499) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 145263 + ... + 145334.
Almost surely, 210461492 is an apocalyptic number.
10461492 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10461492 is an abundant number, since it is smaller than the sum of its proper divisors (15982926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10461492 is a wasteful number, since it uses less digits than its factorization.
10461492 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 290607 (or 290602 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The square root of 10461492 is about 3234.4229779050. The cubic root of 10461492 is about 218.7079361841.
Adding to 10461492 its reverse (29416401), we get a palindrome (39877893).
The spelling of 10461492 in words is "ten million, four hundred sixty-one thousand, four hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •