Base | Representation |
---|---|
bin | 100111111111… |
… | …010111000001 |
3 | 201201121011100 |
4 | 213333113001 |
5 | 10140430022 |
6 | 1012405013 |
7 | 155051040 |
oct | 47772701 |
9 | 21647140 |
10 | 10483137 |
11 | 5a10155 |
12 | 3616769 |
13 | 2230752 |
14 | 156c557 |
15 | dc11ac |
hex | 9ff5c1 |
10483137 has 12 divisors (see below), whose sum is σ = 17305600. Its totient is φ = 5990328.
The previous prime is 10483133. The next prime is 10483139. The reversal of 10483137 is 73138401.
It is not a de Polignac number, because 10483137 - 22 = 10483133 is a prime.
It is a super-2 number, since 2×104831372 = 219792322721538, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10483137.
It is not an unprimeable number, because it can be changed into a prime (10483133) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 83137 + ... + 83262.
Almost surely, 210483137 is an apocalyptic number.
It is an amenable number.
10483137 is a deficient number, since it is larger than the sum of its proper divisors (6822463).
10483137 is a wasteful number, since it uses less digits than its factorization.
10483137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166412 (or 166409 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
The square root of 10483137 is about 3237.7672862638. The cubic root of 10483137 is about 218.8586690548.
The spelling of 10483137 in words is "ten million, four hundred eighty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •