Base | Representation |
---|---|
bin | 100000011011… |
… | …001110011010 |
3 | 120222211222100 |
4 | 200123032122 |
5 | 4134000442 |
6 | 502104230 |
7 | 132151461 |
oct | 40331632 |
9 | 16884870 |
10 | 8500122 |
11 | 48862a4 |
12 | 2a1b076 |
13 | 19b7c77 |
14 | 11b39d8 |
15 | b2d84c |
hex | 81b39a |
8500122 has 24 divisors (see below), whose sum is σ = 18525780. Its totient is φ = 2816640.
The previous prime is 8500117. The next prime is 8500127. The reversal of 8500122 is 2210058.
It is an interprime number because it is at equal distance from previous prime (8500117) and next prime (8500127).
It can be written as a sum of positive squares in 2 ways, for example, as 7502121 + 998001 = 2739^2 + 999^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 8500095 and 8500104.
It is not an unprimeable number, because it can be changed into a prime (8500127) 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, 1954 + ... + 4562.
Almost surely, 28500122 is an apocalyptic number.
8500122 is an abundant number, since it is smaller than the sum of its proper divisors (10025658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8500122 is a wasteful number, since it uses less digits than its factorization.
8500122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2798 (or 2795 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
The square root of 8500122 is about 2915.4968701750. The cubic root of 8500122 is about 204.0837314871.
Subtracting from 8500122 its reverse (2210058), we obtain a square (6290064 = 25082).
The spelling of 8500122 in words is "eight million, five hundred thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •