Base | Representation |
---|---|
bin | 100110100100… |
… | …110000111010 |
3 | 201000202010200 |
4 | 212210300322 |
5 | 10042041213 |
6 | 1000423030 |
7 | 151644135 |
oct | 46446072 |
9 | 21022120 |
10 | 10112058 |
11 | 5787380 |
12 | 3477a76 |
13 | 2130888 |
14 | 14b321c |
15 | d4b273 |
hex | 9a4c3a |
10112058 has 24 divisors (see below), whose sum is σ = 23901696. Its totient is φ = 3064200.
The previous prime is 10112057. The next prime is 10112071. The reversal of 10112058 is 85021101.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10112058.
It is not an unprimeable number, because it can be changed into a prime (10112051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25338 + ... + 25733.
It is an arithmetic number, because the mean of its divisors is an integer number (995904).
Almost surely, 210112058 is an apocalyptic number.
10112058 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
10112058 is an abundant number, since it is smaller than the sum of its proper divisors (13789638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10112058 is a wasteful number, since it uses less digits than its factorization.
10112058 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51090 (or 51087 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 18.
The square root of 10112058 is about 3179.9462259604. The cubic root of 10112058 is about 216.2452204720.
Adding to 10112058 its reverse (85021101), we get a palindrome (95133159).
The spelling of 10112058 in words is "ten million, one hundred twelve thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •