Base | Representation |
---|---|
bin | 111001110111000001… |
… | …1100000111100010101 |
3 | 102212201101220112110121 |
4 | 1303232003200330111 |
5 | 4013432230424221 |
6 | 133025300351541 |
7 | 11656050633634 |
oct | 1635603407425 |
9 | 385641815417 |
10 | 124252983061 |
11 | 4877162a259 |
12 | 200b80a55b1 |
13 | b9423541ac |
14 | 602a11151b |
15 | 337354da41 |
hex | 1cee0e0f15 |
124252983061 has 2 divisors, whose sum is σ = 124252983062. Its totient is φ = 124252983060.
The previous prime is 124252983011. The next prime is 124252983149. The reversal of 124252983061 is 160389252421.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110084604100 + 14168378961 = 331790^2 + 119031^2 .
It is an emirp because it is prime and its reverse (160389252421) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 124252983061 - 213 = 124252974869 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 124252982999 and 124252983017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (124252983011) 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 as a sum of consecutive naturals, namely, 62126491530 + 62126491531.
It is an arithmetic number, because the mean of its divisors is an integer number (62126491531).
Almost surely, 2124252983061 is an apocalyptic number.
It is an amenable number.
124252983061 is a deficient number, since it is larger than the sum of its proper divisors (1).
124252983061 is an equidigital number, since it uses as much as digits as its factorization.
124252983061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 207360, while the sum is 43.
The spelling of 124252983061 in words is "one hundred twenty-four billion, two hundred fifty-two million, nine hundred eighty-three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •