Base | Representation |
---|---|
bin | 1110111000111… |
… | …10101011010101 |
3 | 22201000220002110 |
4 | 13130132223111 |
5 | 223433444242 |
6 | 20221101233 |
7 | 3044454003 |
oct | 734365325 |
9 | 281026073 |
10 | 124906197 |
11 | 64562969 |
12 | 359b7819 |
13 | 1cb540c0 |
14 | 12835a73 |
15 | ae7439c |
hex | 771ead5 |
124906197 has 8 divisors (see below), whose sum is σ = 179352544. Its totient is φ = 76865328.
The previous prime is 124906183. The next prime is 124906207. The reversal of 124906197 is 791609421.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 124906197 - 215 = 124873429 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 3202723 = 124906197 / (1 + 2 + 4 + 9 + 0 + 6 + 1 + 9 + 7).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124906297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1601323 + ... + 1601400.
It is an arithmetic number, because the mean of its divisors is an integer number (22419068).
Almost surely, 2124906197 is an apocalyptic number.
It is an amenable number.
124906197 is a deficient number, since it is larger than the sum of its proper divisors (54446347).
124906197 is a wasteful number, since it uses less digits than its factorization.
124906197 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3202739.
The product of its (nonzero) digits is 27216, while the sum is 39.
The square root of 124906197 is about 11176.1441025069. The cubic root of 124906197 is about 499.8748980349.
The spelling of 124906197 in words is "one hundred twenty-four million, nine hundred six thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •