Base | Representation |
---|---|
bin | 101000000000… |
… | …000011011101 |
3 | 201201202001200 |
4 | 220000003131 |
5 | 10141022411 |
6 | 1012430113 |
7 | 155062242 |
oct | 50000335 |
9 | 21652050 |
10 | 10485981 |
11 | 5a12300 |
12 | 3618339 |
13 | 2231b2c |
14 | 156d5c9 |
15 | dc1e56 |
hex | a000dd |
10485981 has 18 divisors (see below), whose sum is σ = 16650270. Its totient is φ = 6354480.
The previous prime is 10485977. The next prime is 10485989. The reversal of 10485981 is 18958401.
It can be written as a sum of positive squares in only one way, i.e., 10458756 + 27225 = 3234^2 + 165^2 .
It is not a de Polignac number, because 10485981 - 22 = 10485977 is a prime.
It is a super-2 number, since 2×104859812 = 219911595064722, which contains 22 as substring.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10485989) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 3726 + ... + 5903.
It is an arithmetic number, because the mean of its divisors is an integer number (925015).
Almost surely, 210485981 is an apocalyptic number.
10485981 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10485981 is a deficient number, since it is larger than the sum of its proper divisors (6164289).
10485981 is a wasteful number, since it uses less digits than its factorization.
10485981 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9657 (or 9643 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 36.
The square root of 10485981 is about 3238.2064480203. The cubic root of 10485981 is about 218.8784588619.
The spelling of 10485981 in words is "ten million, four hundred eighty-five thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •