Base | Representation |
---|---|
bin | 1110110111011… |
… | …01100010101101 |
3 | 22200122200000112 |
4 | 13123231202231 |
5 | 223411024231 |
6 | 20212505405 |
7 | 3042655154 |
oct | 733554255 |
9 | 280580015 |
10 | 124704941 |
11 | 64435739 |
12 | 3591b265 |
13 | 1cab360a |
14 | 127c259b |
15 | ae3492b |
hex | 76ed8ad |
124704941 has 2 divisors, whose sum is σ = 124704942. Its totient is φ = 124704940.
The previous prime is 124704929. The next prime is 124704953. The reversal of 124704941 is 149407421.
It is a balanced prime because it is at equal distance from previous prime (124704929) and next prime (124704953).
It can be written as a sum of positive squares in only one way, i.e., 90820900 + 33884041 = 9530^2 + 5821^2 .
It is a cyclic number.
It is not a de Polignac number, because 124704941 - 218 = 124442797 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 124704898 and 124704907.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (124704991) 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 as a sum of consecutive naturals, namely, 62352470 + 62352471.
It is an arithmetic number, because the mean of its divisors is an integer number (62352471).
Almost surely, 2124704941 is an apocalyptic number.
It is an amenable number.
124704941 is a deficient number, since it is larger than the sum of its proper divisors (1).
124704941 is an equidigital number, since it uses as much as digits as its factorization.
124704941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 32.
The square root of 124704941 is about 11167.1366518011. The cubic root of 124704941 is about 499.6062780474.
The spelling of 124704941 in words is "one hundred twenty-four million, seven hundred four thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •