Base | Representation |
---|---|
bin | 100111001110… |
… | …010001011101 |
3 | 201100101100200 |
4 | 213032101131 |
5 | 10113011302 |
6 | 1004214113 |
7 | 153252621 |
oct | 47162135 |
9 | 21311320 |
10 | 10282077 |
11 | 5893093 |
12 | 353a339 |
13 | 2190090 |
14 | 1519181 |
15 | d8181c |
hex | 9ce45d |
10282077 has 12 divisors (see below), whose sum is σ = 15994524. Its totient is φ = 6327360.
The previous prime is 10282073. The next prime is 10282109. The reversal of 10282077 is 77028201.
It can be written as a sum of positive squares in 2 ways, for example, as 4186116 + 6095961 = 2046^2 + 2469^2 .
It is not a de Polignac number, because 10282077 - 22 = 10282073 is a prime.
It is a super-2 number, since 2×102820772 = 211442214867858, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10282077.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10282073) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 43824 + ... + 44057.
It is an arithmetic number, because the mean of its divisors is an integer number (1332877).
Almost surely, 210282077 is an apocalyptic number.
It is an amenable number.
10282077 is a deficient number, since it is larger than the sum of its proper divisors (5712447).
10282077 is a wasteful number, since it uses less digits than its factorization.
10282077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87900 (or 87897 counting only the distinct ones).
The product of its (nonzero) digits is 1568, while the sum is 27.
The square root of 10282077 is about 3206.5677912684. The cubic root of 10282077 is about 217.4504365860.
The spelling of 10282077 in words is "ten million, two hundred eighty-two thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •