Base | Representation |
---|---|
bin | 1110110011010… |
… | …01111111110101 |
3 | 22122122021220200 |
4 | 13121221333311 |
5 | 223241304013 |
6 | 20153151113 |
7 | 3035252250 |
oct | 731517765 |
9 | 278567820 |
10 | 124166133 |
11 | 640a7943 |
12 | 356bb499 |
13 | 1c9552b0 |
14 | 126c2097 |
15 | ad79e73 |
hex | 7669ff5 |
124166133 has 24 divisors (see below), whose sum is σ = 220741248. Its totient is φ = 65493792.
The previous prime is 124166131. The next prime is 124166137. The reversal of 124166133 is 331661421.
124166133 is a `hidden beast` number, since 1 + 2 + 41 + 6 + 613 + 3 = 666.
It is not a de Polignac number, because 124166133 - 21 = 124166131 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 124166097 and 124166106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124166131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 74985 + ... + 76622.
It is an arithmetic number, because the mean of its divisors is an integer number (9197552).
Almost surely, 2124166133 is an apocalyptic number.
124166133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
124166133 is a deficient number, since it is larger than the sum of its proper divisors (96575115).
124166133 is a wasteful number, since it uses less digits than its factorization.
124166133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151633 (or 151630 counting only the distinct ones).
The product of its digits is 2592, while the sum is 27.
The square root of 124166133 is about 11142.9858206856. The cubic root of 124166133 is about 498.8856958306.
The spelling of 124166133 in words is "one hundred twenty-four million, one hundred sixty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •